001 - 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

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Posted on 24 February 2009 11:48 > Dear Prof. Lam, > In the assignment, can i use some well-known algirithm in the > intermediate steps? Like Q3, i want to use dijkstra algorithm on G and reverse G to find > shortest path from v and to v in the first steps. Can I use dijkstra > algorithm? Yes, you can make use of algorithms that I taught in the class, without proving the correctness of them. Yet you need to prove the way you use these algorithms can solve the problems in the assignment. > If yes, can I just write down "use dijkstra algorithm on G and reverse G > to find shortest path of all vertex from v and to v" in my answer?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online