Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Tarjan's algorithm

Spot the truth

Report a typo

Which of these statements about the Tarjan’s algorithm are true?

Select one or more options from the list

It uses two series of DFS

The time of entering the nodes needs to be stored

It is used to find the weakly connected components of a graph

The time of leaving the nodes needs to be stored

___

Create a free account to access the full topic