Content deleted Content added
Rating article for WikiProject Mathematics. Quality: Start / Priority: Low / Field: discrete (script assisted). Please report any errors on my talk page. |
|||
Line 55:
(The "forall (v, v') loop is not executed). It results in such a node to be always reported as strongly connected root, while in my understanding it can't be. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/90.80.39.42|90.80.39.42]] ([[User talk:90.80.39.42|talk]]) 10:50, 10 December 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
If v'.index undefined then call Tarjan,
then v'.index = v'.lowlink = 0;
they cannot change since there will not be any lowlink < 0.
So the first vertex will always result to belong to the strongly connected component.
The algorithm is not fixed :-(
Ok, I'll work on it and I'll give you the right pseudocode.
You make me waste my time.
| |||