tpl_components.H File Reference

Graph connectivity and connected components. More...

#include <tpl_agraph.H>
#include <ah-errors.H>

Include dependency graph for tpl_components.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Aleph::Build_Subgraph< GT, SA >
	Build a mapped subgraph from a graph starting at a given node. More...
class	Aleph::Unconnected_Components< GT, SA >
	Compute the connected components of a graph. More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Graph connectivity and connected components.

Algorithms for finding connected components in undirected graphs and testing connectivity. Uses DFS or Union-Find.

Features

• Count connected components
• Extract component subgraphs
• Test if graph is connected

Complexity: O(V + E)

See also

Tarjan.H Strongly connected components for digraphs

Author

Leandro Rabindranath León

Definition in file tpl_components.H.