Timeline for A* path finding for road network - data structure to represent directivity
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 24, 2013 at 22:29 | vote | accept | bsr | ||
| Apr 24, 2013 at 22:29 | comment | added | bsr | thanks Patrick for the comment. With the below answers, I came to read more about Adjacency list, and have an idea about how to approach my problem. | |
| Apr 24, 2013 at 17:54 | comment | added | Patrick Hughes | Have you considered a directed graph data structure? There are a number of algorithms to accomplish what you want, plus graphs are one of the most studied of comp-sci data structures. | |
| Apr 24, 2013 at 14:17 | answer | added | user470365 | timeline score: 1 | |
| Apr 24, 2013 at 7:53 | history | tweeted | twitter.com/#!/StackGameDev/status/326967104098156544 | ||
| Apr 24, 2013 at 2:39 | answer | added | jmegaffin | timeline score: 6 | |
| Apr 24, 2013 at 2:07 | comment | added | Pieter Geerkens | Each node independently has a list of adjacent nodes reachable FROM itself. This may be stored statically, or calculated dynamically, or a combination. | |
| Apr 24, 2013 at 2:05 | history | asked | bsr | CC BY-SA 3.0 |