Class StronglyConnectedComponentsAlgorithm<TVertex, TEdge>

Algorithm that computes strongly connected components of a graph.

Inheritance
System.Object
AlgorithmBase<IVertexListGraph<TVertex, TEdge>>
StronglyConnectedComponentsAlgorithm<TVertex, TEdge>
Implements
IConnectedComponentAlgorithm<TVertex, TEdge, IVertexListGraph<TVertex, TEdge>>
IAlgorithm<IVertexListGraph<TVertex, TEdge>>
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Namespace: QuikGraph.Algorithms.ConnectedComponents
Assembly: QuikGraph.dll
Syntax
public sealed class StronglyConnectedComponentsAlgorithm<TVertex, TEdge> : AlgorithmBase<IVertexListGraph<TVertex, TEdge>>, IAlgorithmComponent, IConnectedComponentAlgorithm<TVertex, TEdge, IVertexListGraph<TVertex, TEdge>>, IAlgorithm<IVertexListGraph<TVertex, TEdge>>, IComputation where TEdge : IEdge<TVertex>
Type Parameters
Name Description
TVertex

Vertex type.
TEdge

Edge type.
Remarks

A strongly connected component is a sub graph where there is a path from every vertex to every other vertices.

Constructors

| Improve this Doc View Source

StronglyConnectedComponentsAlgorithm(IAlgorithmComponent, IVertexListGraph<TVertex, TEdge>, IDictionary<TVertex, Int32>)

Initializes a new instance of the StronglyConnectedComponentsAlgorithm<TVertex, TEdge> class.

Declaration
public StronglyConnectedComponentsAlgorithm(IAlgorithmComponent host, IVertexListGraph<TVertex, TEdge> visitedGraph, IDictionary<TVertex, int> components)
Parameters
Type Name Description
IAlgorithmComponent host

Host to use if set, otherwise use this reference.
IVertexListGraph<TVertex, TEdge> visitedGraph

Graph to visit.
System.Collections.Generic.IDictionary<TVertex, System.Int32> components

Graph components.
Exceptions
Type Condition
System.ArgumentNullException

visitedGraph is null.
System.ArgumentNullException

components is null.
| Improve this Doc View Source

StronglyConnectedComponentsAlgorithm(IVertexListGraph<TVertex, TEdge>)

Initializes a new instance of the StronglyConnectedComponentsAlgorithm<TVertex, TEdge> class.

Declaration
public StronglyConnectedComponentsAlgorithm(IVertexListGraph<TVertex, TEdge> visitedGraph)
Parameters
Type Name Description
IVertexListGraph<TVertex, TEdge> visitedGraph

Graph to visit.
Exceptions
Type Condition
System.ArgumentNullException

visitedGraph is null.
| Improve this Doc View Source

StronglyConnectedComponentsAlgorithm(IVertexListGraph<TVertex, TEdge>, IDictionary<TVertex, Int32>)

Initializes a new instance of the StronglyConnectedComponentsAlgorithm<TVertex, TEdge> class.

Declaration
public StronglyConnectedComponentsAlgorithm(IVertexListGraph<TVertex, TEdge> visitedGraph, IDictionary<TVertex, int> components)
Parameters
Type Name Description
IVertexListGraph<TVertex, TEdge> visitedGraph

Graph to visit.
System.Collections.Generic.IDictionary<TVertex, System.Int32> components

Graph components.
Exceptions
Type Condition
System.ArgumentNullException

visitedGraph is null.
System.ArgumentNullException

components is null.

Properties

| Improve this Doc View Source

ComponentCount

Number of components.

Declaration
public int ComponentCount { get; }
Property Value
Type Description
System.Int32
| Improve this Doc View Source

Components

Graph components.

Declaration
public IDictionary<TVertex, int> Components { get; }
Property Value
Type Description
System.Collections.Generic.IDictionary<TVertex, System.Int32>
| Improve this Doc View Source

ComponentsPerStep

Number of components discovered per step.

Declaration
public List<int> ComponentsPerStep { get; }
Property Value
Type Description
System.Collections.Generic.List<System.Int32>
| Improve this Doc View Source

DiscoverTimes

Times of vertices discover.

Declaration
public IDictionary<TVertex, int> DiscoverTimes { get; }
Property Value
Type Description
System.Collections.Generic.IDictionary<TVertex, System.Int32>
| Improve this Doc View Source

Graphs

Strongly connected components.

Declaration
public BidirectionalGraph<TVertex, TEdge>[] Graphs { get; }
Property Value
Type Description
BidirectionalGraph<TVertex, TEdge>[]
| Improve this Doc View Source

Roots

Root vertices associated to their minimal linked vertex.

Declaration
public IDictionary<TVertex, TVertex> Roots { get; }
Property Value
Type Description
System.Collections.Generic.IDictionary<TVertex, TVertex>
| Improve this Doc View Source

Steps

Number of steps spent.

Declaration
public int Steps { get; }
Property Value
Type Description
System.Int32
| Improve this Doc View Source

VerticesPerStep

Vertices treated per step.

Declaration
public List<TVertex> VerticesPerStep { get; }
Property Value
Type Description
System.Collections.Generic.List<TVertex>

Methods

| Improve this Doc View Source

Initialize()

Called on algorithm initialization step.

Declaration
protected override void Initialize()
Overrides
QuikGraph.Algorithms.AlgorithmBase<QuikGraph.IVertexListGraph<TVertex, TEdge>>.Initialize()
| Improve this Doc View Source

InternalCompute()

Algorithm compute step.

Declaration
protected override void InternalCompute()
Overrides
QuikGraph.Algorithms.AlgorithmBase<QuikGraph.IVertexListGraph<TVertex, TEdge>>.InternalCompute()

Implements

Extension Methods