Question

In which of the following scenarios would the Floyd-Warshall algorithm be most suitable?

A Finding the shortest path from a single starting point to all other points in a very sparse graph with positive edge weights.
B Finding the Minimum Spanning Tree of a graph.
C Determining the shortest paths between all pairs of nodes in a dense network where negative edge weights might exist (but no negative cycles).
D Searching for a specific element in a sorted array.
E Optimizing a complex scheduling problem with many constraints.
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)