Talk:Tarjan: Difference between revisions

Line 14:

Any thoughts? --[[User:Ledrug|Ledrug]] ([[User talk:Ledrug|talk]]) 08:37, 9 March 2020 (UTC)

Perhaps the task description needs better detail. ~~The~~ ~~code~~ examples ~~work~~ if ~~all~~ ~~points~~ ~~are~~ ~~those~~ of a ~~digraph so 0~~ => 1 ~~means that 0 is~~

Perhaps the task description needs better detail. Note that the examples never show reciprocal connections -- if there is a 2 => 4,

⚫

we never see 4 => 2 listed in the data, for some reason?

connected to 1 the same way as 1 is to 0. Note that the examples never show reciprocal connections -- if there is a 2 => 4, we never

⚫

see 4 => 2 listed in the data ~~-- it's~~ a ~~digraph.~~

--[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 08:19, 9 March 2020 (UTC)

Line 22:

Line 21:

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)

Ah, you mean that [[0], [1]] and [0, 1] are different answers. I see. I guess that the lack of any reciprocal connections is just the way the examples are written then. I'll correct my response. --[[User:Wherrera|Wherrera]] ([[User talk:Wherrera|talk]]) 09:36, 9 March 2020 (UTC)