Given |
: | A digraph
G = (V, E) in which each arc
has a non-negative cost and one vertex is designated as the source. |

Problem |
: | To determine the cost of the shortest
path from the source to every other vertex in V (where the length of a
path is just the sum of the costs of the arcs on the path). |

- 7.2.1 Single Source Shortest Paths Problem: Dijkstra's Algorithm
- 7.2.2 Dynamic Programming Algorithm
- 7.2.3 All Pairs Shortest Paths Problem: Floyd's Algorithm

eEL,CSA_Dept,IISc,Bangalore