3 ms·Hmm. Dijkstra = Nearest Node First, Bellman-Ford = Shortest k-Edge Path.by ogogmad 6y agoHmm. Dijkstra = Nearest Node First, Bellman-Ford = Shortest k-Edge Path.3np 6y agoHow about A*?afiori 6y agoat 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