Graph Algorithms
15:00
Question 1 of 15
Dijkstra's single-source shortest path algorithm, when run from a vertex 'v' in a weighted, undirected graph, can fail if: [GATE CS 2010]
The graph has cycles.
The graph has negative edge weights.
The graph is disconnected.
The graph has parallel edges.