slides - Computer Science - University of San Francisco
slides - Computer Science - University of San Francisco
slides - Computer Science - University of San Francisco
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
17-30: Dijkstra’s AlgorithmAfter Dijkstra’s algorithm is complete:We know the length <strong>of</strong> the shortest pathWe do not know what the shortest path isHow can we modify Dijstra’s algorithm to computethe path?Store not only the distance, but the immediateparent that led to this distance
Change language