Single-source shortest path What is the optimal path from one vertex to another? o Suppose each edge is of unit length o Store the minimum distances in an array dist[ 0 Example:if source vertexs ="3" dist[u] o! u 03 1 1 30 e4 2 0∞ 3 0 6 4 2 5 2 1 6 ● ● 7 3Single-source shortest path • What is the optimal path from one vertex to another? o Suppose each edge is of unit length o Store the minimum distances in an array dist[] o Example: if source vertex s = “3” 1 2 3 4 5 6 7 u dist[u] 1 1 2 ∞ 3 0 4 2 5 2 6 ∞ 7 3