This preview shows page 1. Sign up to view the full content.
Unformatted text preview: You need to be more specific. Dijkstra's alg doesn't deals with G and G reverse simultaneously. I can accept "use dijkstra algorithm on G to find shortest paths from v to all vertexes". For the other case, I expect you to put down "the shortest path from vertex u to vertex v in G is also the shortest path from vertex v to vertex u is G reverse. Therefore, using Dijkstra's algorithm on G reverse, we can find the shortest paths from v to all vertexes, which are indeed the shortest paths from all vertexes to v." Tak...
View Full Document
This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.
- Spring '10