Find Strongly Connected Components in a Directed Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 12: | Line 12: | ||
[[Graph_Concepts#Strongly_Connected_Component|Strongly connected components]] of a directed graph can be computed with Kosaraju's Two-Pass algorithm, which consists of two passes of [[Graph_Search#DFS_and_Directed_Connectivity_-_Compute_Strong_Components|depth-first search]]. | [[Graph_Concepts#Strongly_Connected_Component|Strongly connected components]] of a directed graph can be computed with Kosaraju's Two-Pass algorithm, which consists of two passes of [[Graph_Search#DFS_and_Directed_Connectivity_-_Compute_Strong_Components|depth-first search]]. | ||
=Algorithm= | =Kosaraju's Two-Pass Algorithm= | ||
Revision as of 22:07, 4 October 2021
External
- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/rng2S/computing-strong-components-the-algorithm
- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/QFOFt/computing-strong-components-the-analysis
Internal
Overview
Finding strongly connected components in a directed graph is a form of clustering heuristics: strongly connected components represent clusters where the objects represented by the vertices are clustered in some way.
Strongly connected components of a directed graph can be computed with Kosaraju's Two-Pass algorithm, which consists of two passes of depth-first search.