A path P from s to t minimising Σ w(e) over edges. Dijkstra (non-neg weights, O((V+E)log V)), Bellman–Ford (general weights, O(VE)), Floyd–Warshall (all-pairs, O(V³)).
A path P from s to t minimising Σ w(e) over edges. Dijkstra (non-neg weights, O((V+E)log V)), Bellman–Ford (general weights, O(VE)), Floyd–Warshall (all-pairs, O(V³)).