Numbers of vertices in components in a directed graph

Revision en2, by _DarkNess, 2020-07-05 07:46:21

Sorry about the last blog, i didn't prepared well for the question . I was wondering how to count the numbers of vertices in components, and now i knew 2 algo to do that is, Kosaraju algorithm and Tarjan algorithm, i want to ask what is the difference between this 2, when Korasaju is better and when Tarjan is better. Thanks a lot !!

Tags #graph, #dfs and similar


  Rev. Lang. By When Δ Comment
en2 English _DarkNess 2020-07-05 07:46:21 272
en1 English _DarkNess 2020-07-04 14:27:36 165 Initial revision (published)