Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsConnectivity algorithms

Kosaraju's algorithm

Why output times?

Report a typo

Kosaraju's algorithm is based on an important property of output times:

Assume we have two SCC-s, $C_1$ and $C_2$ and an edge from some node in $C_1$ to some node in $C_2$ . Denote by $out_1$ the largest output time among all nodes in $C_1$ , and similiarly $out_2$ for $C_2$ .

What does this property assert?

Select one option from the list

out_1 > out_2

out_1 = out_2

out_1 < out_2

the property is not about

out_1

and

out_2

___

Create a free account to access the full topic