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) ?
- A.
BFS
- B.
Prim’s algorithm
- C.
Kosaraju’s or Tarjan’s algorithm
- D.
Dijkstra’s algorithm
Attempted by 60 students.
Sign up free to check your answer
Sign up freeLoading lesson…

