Find Connected Components in an Undirected Graph: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Graphs") |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Graphs#Subjects|Graphs]] | * [[Graphs#Subjects|Graphs]] | ||
=Overview= | |||
Finding connected components in an undirected graph is a form of clustering heuristics: connected vertices represent clusters where the objects represented by the vertices are clustered in some way. | |||
Revision as of 19:34, 1 October 2021
Internal
Overview
Finding connected components in an undirected graph is a form of clustering heuristics: connected vertices represent clusters where the objects represented by the vertices are clustered in some way.