Java Programming

Announcement

For appeals, questions and feedback about Oracle Forums, please email oracle-forums-moderators_us@oracle.com. Technical questions should be asked in the appropriate category. Thank you!

Strongly Connected Components

807569Jun 13 2006 — edited Jun 14 2006

I know the algorithm but can't understand something:

DFS(G)
DFS(G-reverse) [in the main loop order by decreasing finishing times]

But then how can we understand which of them are strongly connected? By looking finishing times or what?

Locked Post

New comments cannot be posted to this locked post.

Locked on Jul 12 2006

Added on Jun 13 2006

24 comments

279 views