DT Q17
- Option : D
- Explanation : Dijkstra’s single source shortest path in not gives the guarantee to work on negative weight edges graph. But in this graph it gives the correct shootest path for all vertex. Shortest path for B → 1 e → –2 F → O g → 3 h → –2 d → 6 C → 3
