Question

Which algorithm finds the shortest paths between all pairs of vertices in a weighted graph?

A Dijkstra’s Algorithm
B Bellman-Ford Algorithm
C Floyd-Warshall Algorithm
D Prim’s Algorithm
E Kruskal’s Algorithm
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)