Find Strongly Connected Components in a Directed Graph: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= =Overview= Finding strongly connected components in a directed graph is a form of clustering heuristics: strongly connected components represent clusters where the...") |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Graphs#Subjects|Graphs]] | |||
=Overview= | =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. | 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. | ||
Revision as of 19:36, 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.