Find Strongly Connected Components in a Directed Graph
Jump to navigation
Jump to search
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.