Find Connected Components in an Undirected Graph

From NovaOrdis Knowledge Base
Revision as of 23:03, 1 October 2021 by Ovidiu (talk | contribs) (→‎Internal)
Jump to navigation Jump to search

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 related in some way. Connected components in an undirected graph are computed with a variation of the breadth-first search (BFS) algorithm.

Retrieved from "https://kb.novaordis.com/index.php?title=Find_Connected_Components_in_an_Undirected_Graph&oldid=82663"