Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Tarjan's algorithm

Reconstructing the algorithm

Report a typo

Order the steps that you should take to perform Tarjan’s algorithm:

Put the items in the correct order

Pop the values from the stack if the current node is the root of the SCC

Start DFS

Make recursive calls for the unvisited children of the current node

Push the current node onto the stack

Check whether the current node is the root of the SCC

___

Create a free account to access the full topic