Question

The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?

A V
B V–1
C E
D log V
E Until convergence only
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)