Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
method for finding the shortest path from a single source vertex to every other vertex in a graph, regardless of whether the graph is weighted or unweighted. This algorithm is similar to Dijkstra's algorithm but has the added ability to handle negative edge weights and negative cycles in a graph,