Lecture 18 Solving Shortest Path Problem: Dijkstra’s Algorithm
Lecture 18Solving Shortest Path Problem: Dijkstra s AlgorithmOctober 23, 2009Lecture 18Outline Focus on Dijkstra s Algorithm Importance: Where it has been used? Algorithm s general description Algorithm steps in detail ExampleOperations research Methods1Lecture 18One-To-All Shortest Path ProblemWe are given a weighted network(V, E, C)with node setV, edge setE,and the weight setCspecifying weightscijfor the edges(i, j) E. We arealso given a starting nodes V. Theone-to-all Shortest pathproblem isthe problem of determining the Shortest path from nodesto all the othernodes in the weights on the links are also referred research Methods2Lecture 18Algorithms Solving the Problem Dijkstra s Algorithm Solves only the problems with nonnegative costs, ,cij 0for all(i, j) E Bellman-Ford Algorithm Applicable to problems with arbitrary costs Floyd-Warshall Algorithm Applicable to problems with arbitrary costs Solves a more general
Operations Research Methods 1. Lecture 18 One-To-All Shortest Path Problem We are given a weighted network (V,E,C) with node set V, edge set E, and the weight set C specifying weights c ij for the edges (i,j) ∈ E. We are also given a starting node s ∈ V. The one-to-all shortest path problem is
Download Lecture 18 Solving Shortest Path Problem: Dijkstra’s Algorithm
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: