Q34
Which algorithm is used to find the strongly connected components of a directed graph?
A.
Dijkstra's Algorithm
B.
Kruskal's Algorithm
C.
Kosaraju's Algorithm
AnswerD.
Prim's Algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board