Identify the number of Strongly Connected Components
Given the following reverse graph below, alongside its reverse order of finishing times (DFS starting at node 1), please, identify the number of strongly connected components in the original graph, using the Kosaraju-Sharir’s algorithm:
Good question.
ResponderExcluirI simplified it a bit. Hope you don't mind.
ResponderExcluir