Which of the following statements is true about the Kosaraju-Sharir's algorithm?
A) It is used to find the shortest path between two nodes in a graph.
B) It is a greedy algorithm that always finds the optimal solution.
C) It is used to determining the strongly connected components in a directed graph.
D) It is used to computing the minimum spanning tree of a graph
E) None of the above.
Original idea by: Arthur Hendricks.
No comments:
Post a Comment