Tarjan's algorithm was performed on some graph in order to find the SCCs.
During its work, some values were calculated:
- entering_time – the time that passed from the moment the algorithm started until the certain node was visited;
- small_time – the smallest entering time of the nodes of the given graph that are reachable through the DFS subgraph of the current node.
Look at the values and find the roots of the found components:
| Node | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| entering_time | 0 | 1 | 3 | 4 | 2 | 6 | 7 | 5 |
| small_time | 0 | 1 | 0 | 0 | 0 | 0 | 7 | 0 |