Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Shortest Paths
When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true?
1
It can find shortest path within the same graph data structure
2
Every time a new node is visited, we choose the node with smallest known distance/cost (weight) to visit first
3
Shortest path always passes through least number of vertices
4
The graph needs to have a non-negative weight on every edge