Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
tpl_cut_nodes.H File Reference

Articulation points (cut nodes) and bridges. More...

#include <tpl_graph_utils.H>
Include dependency graph for tpl_cut_nodes.H:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  Aleph::Compute_Cut_Nodes< GT, SA >
 Computation of cut nodes (articulation points) of a graph. More...
 

Namespaces

namespace  Aleph
 Main namespace for Aleph-w library functions.
 

Detailed Description

Articulation points (cut nodes) and bridges.

Finds cut vertices and bridge edges whose removal disconnects the graph. Uses DFS with low-link values.

Features

  • Find all cut vertices
  • Find all bridges
  • Compute biconnected components

Complexity: O(V + E)

See also
tpl_components.H Connected components
Author
Leandro Rabindranath León

Definition in file tpl_cut_nodes.H.