Content deleted Content added
→Algorithm is still broken: Refute that the algorithm is broken |
|||
Line 104:
Ok, I'll work on it and I'll give you the right pseudocode.
You make me waste my time. [[User:Jimifiki|Jimifiki]] ([[User talk:Jimifiki|talk]]) 12:17, 21 March 2010 (UTC) <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/89.226.101.99|89.226.101.99]] ([[User talk:89.226.101.99|talk]]) 11:26, 21 March 2010 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
* The algorithm is correct in this regard. A node without a successor ''is'' always a SCC root. By definition, it forms its own single-node SCC, because it is not part of any loops. (In other words, it is like a leaf of a tree.) As for "the first vertex will always result to belong to the strongly connected component" -- yes, this is also true. ''All'' vertices belong to some SCC, it is just a matter of which. The first vertex is always the root of some SCC. The root of an SCC is defined as the node with the lowest index in the SCC, so the node with index 0 will always be the root of whichever SCC it ends up inside of. '''None of the above comments are issues with the algorithm''' —[[User:MattGiuca|MattGiuca]] ([[User talk:MattGiuca|talk]]) 06:35, 8 February 2011 (UTC)
==Algorithm Fixed==
| |||