Anonymous user
Talk:Tarjan: Difference between revisions
no edit summary
(I disagree (and forgot how to indent my reply)) |
No edit summary |
||
Line 20:
That can't be right. "Strongly connected" means between two nodes A and B, there is a path from A to B *and* there is a path from B to A, which only makes sense if edges are directed. If all connections are bidirectional, there is no difference between "connected" and "strongly connected", and the algorithm only needs a depth-first traversal without much of the bookkeeping at all. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 08:37, 9 March 2020 (UTC)
EDIE: Never mind: a node not strongly connected to anything else is considered to form its own component, so the above output is correct. Silly me. --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 09:28, 9 March 2020 (UTC)
| |||