Re:Ask HN: What is the weirdest or most surreal (recent) tec...
by twic on Tuesday January 24, 2023 @12:49PM
(#34507178)
> It necessarily cannot solve as many problems as a star.
Could you give an example of a positive-weight shortest path problem with A* can solve, but Dijkstra's algorithm cannot? I do not believe there is such a thing. Or did you mean something else?
> And Dijkstra's won't work in "any case" at all, esp graphs with negative edge weights.
Could you give an example of a positive-weight shortest path problem with A* can solve, but Dijkstra's algorithm cannot? I do not believe there is such a thing. Or did you mean something else?
> And Dijkstra's won't work in "any case" at all, esp graphs with negative edge weights.
A* won't solve those either.