This is an old revision of the document!
4.4. Shortest paths in a graph
The Problem
- We are given a directed graph G = (V,E) with a starting node S.We assume that s has a path to every other node in G.
- Each edge e has a length le≥ 0, which it the cost of traversing e.
- For each path P, the length of P(l(P)) = ∑ of all edges in P.
–>Goal of the algorithm: Determine the shortest path from S to every other node in the graph.
