Finds the bridges and 2-edge-connected components in a graph. More...

Public Types
enum	Flags { None = 0, CreateComponents = 1 << 0, CreateBridges = 1 << 1 }

Public Member Functions
	BiEdgeConnectedComponents (IGraph graph, Flags flags=0)

Properties
HashSet< Arc >	Bridges `[get, set]`
	The bridges of the graph. More...

List< HashSet< Node > >	Components `[get, set]`
	The 2-edge-connected components of the graph. More...

int	Count `[get, set]`
	The number of 2-edge-connected components in the graph. More...

IGraph	Graph `[get, set]`
	The input graph. More...

Detailed Description

Finds the bridges and 2-edge-connected components in a graph.

Definition at line 406 of file Connectivity.cs.

Member Enumeration Documentation

Enumerator
None
CreateComponents	If set, Components will contain the 2-edge-connected components.
CreateBridges	If set, Bridges will contain the bridges.

Definition at line 409 of file Connectivity.cs.

Satsuma.BiEdgeConnectedComponents.BiEdgeConnectedComponents	(	IGraph	graph,
		Flags	flags = `0`
	)

Definition at line 429 of file Connectivity.cs.

HashSet<Arc> Satsuma.BiEdgeConnectedComponents.Bridges

getset

The bridges of the graph.

Null if Flags.CreateBridges was not set during construction.

Definition at line 427 of file Connectivity.cs.

List<HashSet<Node> > Satsuma.BiEdgeConnectedComponents.Components

getset

The 2-edge-connected components of the graph.

Null if Flags.CreateComponents was not set during construction.

Definition at line 424 of file Connectivity.cs.

int Satsuma.BiEdgeConnectedComponents.Count

getset

The number of 2-edge-connected components in the graph.

Definition at line 421 of file Connectivity.cs.

IGraph Satsuma.BiEdgeConnectedComponents.Graph

getset

The input graph.

Definition at line 419 of file Connectivity.cs.

The documentation for this class was generated from the following file: