Which graph traversal algorithm is used to detect strongly connected…

TPSC Computer/IT Posts 2026

Which graph traversal algorithm is used to detect strongly connected components (SCCs) ?

  1. A.

    BFS

  2. B.

    Prim’s algorithm

  3. C.

    Kosaraju’s or Tarjan’s algorithm

  4. D.

    Dijkstra’s algorithm

Attempted by 60 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…