Timeline for Is Dijkstra's algorithm an appropriate solution to this signal routing problem?
Current License: CC BY-SA 3.0
2 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Dec 7, 2011 at 4:04 | comment | added | Steven Evers | +1: As well, IIRC, the heuristic has to always estimate a cost that is worse than the actual cost in order for it to guarantee an optimal path. In the worst case, if you can't get the heuristic right, just return 0 from the heuristic and you've got dijkstra's algorithm. | |
Dec 7, 2011 at 2:21 | history | answered | jdt141 | CC BY-SA 3.0 |