Find Strongly Connected Components in a Directed Graph: Difference between revisions
Jump to navigation
Jump to search
m (Ovidiu moved page Find Strongly Connected Components in an Directed Graph to Find Strongly Connected Components in a Directed Graph without leaving a redirect) |
|
(No difference)
| |
Revision as of 21:30, 1 October 2021
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.