3 ms·

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

• ogogmad 6y ago
  Hmm. Dijkstra = Nearest Node First, Bellman-Ford = Shortest k-Edge Path.
  • 3np 6y ago
    How about A*?
  • afiori 6y ago
    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