Question

Dijkstra's shortest path algorithm is guaranteed to produce correct results only when the input graph:

A Contains at least one cycle
B Is a complete graph
C Contains no edges with negative weights
D Is undirected
E Has fewer than 100 vertices
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)