This preview shows pages 1–7. Sign up to view the full content.
1Lecture 4/5Shortest Path ProblemsExampleFollowing your suggestions (based on MST), the executive board of your company built the connecting wires between the cities. However, they chose to include additional power lines (to have a reliable network). Now they approach you again hoping to get an answer for a somewhat different problem:A power plant has been built in Albany, and the produced power should be sent to Trenton. But there are different ways to achieve this in the constructed network. The specific question is: What is the shortest path in the network from Albany to Trenton?
This preview
has intentionally blurred sections.
Sign up to view the full version.
2Example 11234563323422AlbanyTrenton(see Winston, Example 1, page 414)Given a graph with edge weights cij≥0. Find a shortest path from node 1 to node 6.Solution: Dijkstra’s algorithmIdea: Instead of computing the shortest path from node 1 to 6, we compute allshortest paths from node 1 to node i (i=2,..,6).