Timeline for Simplifying finding neighbors in graph
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2015 at 19:34 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 12 characters in body; edited tags
|
| May 2, 2015 at 19:33 | history | edited | Caridorc | CC BY-SA 3.0 |
meaningful title
|
| May 2, 2013 at 13:57 | answer | added | Winston Ewert | timeline score: 2 | |
| May 2, 2013 at 11:20 | comment | added | LordDoskias | Oops, you are completely correct. My brain is fried :) | |
| May 1, 2013 at 18:22 | comment | added | Winston Ewert | Yes it checks the visited status, but it doesn't change the visited status does it? | |
| May 1, 2013 at 18:18 | comment | added | LordDoskias | Yes, but in order to get the list it needs to follow certain rules such as not creating loop in a graph (the union-find portion) and also it shouldn't consider already visited nodes. | |
| May 1, 2013 at 17:30 | comment | added | Winston Ewert | But getFeasibleNeighbors doesn't pick the neighbour. It just returns a list of them. | |
| May 1, 2013 at 17:25 | comment | added | LordDoskias | Because in picking the feasible neighbor it will have to accordingly update the state variables - visited and UF, and at the same time those variable need to persist across executions of the loop | |
| May 1, 2013 at 14:42 | answer | added | Landei | timeline score: 1 | |
| May 1, 2013 at 13:17 | comment | added | Winston Ewert | Why would getFeasibleNeighbours modify visited and uf? | |
| May 1, 2013 at 11:06 | history | tweeted | twitter.com/#!/StackCodeReview/status/329552363402711040 | ||
| May 1, 2013 at 1:56 | review | First posts | |||
| May 1, 2013 at 4:46 | |||||
| May 1, 2013 at 1:36 | history | asked | LordDoskias | CC BY-SA 3.0 |