Finds the strongly connected components of a digraph. More...

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

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

Properties
List< HashSet< Node > >	Components `[get, set]`
	The strongly connected components of the digraph, in a topological order of the component DAG (initial components first). More...

int	Count `[get, set]`
	The number of strongly connected components in the digraph. More...

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

Detailed Description

Finds the strongly connected components of a digraph.

Edges count as 2-cycles.

Definition at line 253 of file Connectivity.cs.

Member Enumeration Documentation

Enumerator
None
CreateComponents	If set, Components will contain the strongly connected components.

Definition at line 256 of file Connectivity.cs.

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

Definition at line 316 of file Connectivity.cs.

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

getset

The strongly connected components of the digraph, in a topological order of the component DAG (initial components first).

Null if Flags.CreateComponents was not set during construction.

Definition at line 270 of file Connectivity.cs.

int Satsuma.StrongComponents.Count

getset

The number of strongly connected components in the digraph.

Definition at line 266 of file Connectivity.cs.

IGraph Satsuma.StrongComponents.Graph

getset

The input digraph.

Definition at line 264 of file Connectivity.cs.

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