Talk:Tarjan's strongly connected components algorithm: Difference between revisions

Revision as of 14:25, 21 February 2024

Latest revision as of 17:05, 14 January 2025

Line 164:

== Counterexample ==

<syntaxhighlight lang="text">

<code>

<pre>

node size : 12

map :

Line 180 ⟶ 179:

0 1 1 0 0 0 0 0 0 0 0 0

0 0 0 1 0 0 0 0 0 0 0 0

</syntaxhighlight>

</pre></code>

In this case the whole graph is strongly connected