Find Connected Components in an Undirected Graph: Difference between revisions
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
* [[Graphs#Subjects|Graphs]] | * [[Graphs#Subjects|Graphs]] | ||
=Overview= | =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. Connected components in an undirected graph are computed with a variation of the breadth-first search (BFS) algorithm. | 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. Connected components in an undirected graph are computed with a variation of the [[Graph_Search#Breadth-First_Search_.28BFS.29|breadth-first search (BFS)]] algorithm. | ||
Revision as of 19:38, 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. Connected components in an undirected graph are computed with a variation of the breadth-first search (BFS) algorithm.