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

Revision as of 00:23, 1 February 2013

Revision as of 14:55, 24 June 2013

Line 197:

END;

—[[User:MattGiuca|MattGiuca]] ([[User talk:MattGiuca|talk]]) 10:36, 8 February 2011 (UTC)

== Where to store "lowlink" ==

As I see, we read the parameter "lowlink" only from child nodes and current node and we write it only to current node. Therefore, we can have this parameter as a local variable and return it from "strongconnect". I. e. we can store "lowlink" on the stack for recursive calls (= [[Depth-first search|DFS]] algorithm stack). In such a way, this algorithm is connected to [[path-based strong component algorithm]]. From the stack of lowlinks we can compute the ''P'' stack. --[[User:Beroal|Beroal]] ([[User talk:Beroal|talk]]) 14:55, 24 June 2013 (UTC)