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