Timeline for A* path finding for road network - data structure to represent directivity
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 25, 2013 at 15:56 | comment | added | jmegaffin | Not really. If each node contains its position, the algorithm should easily be able to calculate the distance between two adjacent nodes. However, if the cost is non-trivial, such as terrain cost, that should be stored in each node or in dedicated edge structures. | |
| Apr 25, 2013 at 12:36 | comment | added | MSalters | For A* you need the true distances (cost function) per neighbor as well. | |
| Apr 24, 2013 at 22:29 | vote | accept | bsr | ||
| Apr 24, 2013 at 2:39 | history | answered | jmegaffin | CC BY-SA 3.0 |