InterviewSolution
Saved Bookmarks
| 1. |
If there are more than 1 topological sorting of a DAG is possible, which of the following is true.(a) Many Hamiltonian paths are possible(b) No Hamiltonian path is possible(c) Exactly 1 Hamiltonian path is possible(d) Given information is insufficient to comment anythingThe above asked question is from Directed Acyclic Graph topic in portion Graph of Data Structures & Algorithms IThis question was addressed to me in my homework. |
|
Answer» CORRECT ANSWER is (b) No Hamiltonian path is possible The best explanation: For a Hamiltonian path to exist all the vertices must be connected with a path, had that happened there WOULD have been a UNIQUE topological sort. |
|