Strongly Connected Components
Q1. What is the time complexity of kosaraju's algorithm? Assume the graph has n vertices and m edges.
Q2. What is the space complexity of kosaraju's algorithm? Assume the graph has n vertices and m edges. Do not consider the space required to store the graph.
Q3. The Kosaraju's algorithm is used only for directed graphs. True or False?
Q4. A graph with n nodes is a DAG (Directed Acyclic Graph), what are the number of strongly connected components in the graph?