Question

Which algorithm is best suited to find the shortest path in a graph with negative edge weights but no negative cycles?

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