Hacker News Reader

Yet we still have Dijkstra's algorithm vs Belmann-Ford, because their differences cannot be captured well in a single word.

View on HN

Hmm. Dijkstra = Nearest Node First, Bellman-Ford = Shortest k-Edge Path.

How about A*?

at this point in time it is probably a better idea to simply list both dijkstra and bellman-ford in a wikipedia page for optimal path finding algorithm

Reply on news.ycombinator.com