Question

Tarjan’s algorithm is used to find:

A Minimum spanning tree
B Strongly connected components
C Shortest path
D Maximum flow
E Cut 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)