Timeline for Finding the closest node
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 9, 2014 at 2:29 | history | edited | Jamal | CC BY-SA 3.0 |
added 11 characters in body
|
| Mar 31, 2013 at 16:54 | vote | accept | fread2281 | ||
| Mar 31, 2013 at 16:54 | vote | accept | fread2281 | ||
| Mar 31, 2013 at 16:54 | |||||
| Mar 30, 2013 at 19:32 | comment | added | Winston Ewert | @fread2281, my bad... I didn't think of that. Actually, I think that makes your code wrong. Its implementing a DFS, so it wasn't neccesairlly find the closest "station" | |
| Mar 30, 2013 at 19:01 | comment | added | fread2281 | The first loop needs to be run on all litems and if none are station, it should search recursively | |
| Mar 30, 2013 at 18:56 | history | answered | Winston Ewert | CC BY-SA 3.0 |