Class BreadthFirstChainDecompositionOld<TNode>

The algorithm starts with the smallest chains. It then looks for connected faces that are as small as possible. If no such face exists, paths close to already covered nodes are considered. When a face can be processed, it has greater priority than paths.

Inheritance
System.Object
ChainDecompositionBase<TNode>
BreadthFirstChainDecompositionOld<TNode>
Implements
Inherited Members
Namespace: Edgar.Legacy.Core.ChainDecompositions
Assembly: Edgar.dll
Syntax
public class BreadthFirstChainDecompositionOld<TNode> : ChainDecompositionBase<TNode>, IChainDecomposition<TNode>
Type Parameters
Name Description
TNode

Constructors

BreadthFirstChainDecompositionOld(Boolean)

Declaration
public BreadthFirstChainDecompositionOld(bool groupSoloVertices = true)
Parameters
Type Name Description
System.Boolean groupSoloVertices

Methods

GetChains(IGraph<TNode>)

Declaration
public override List<Chain<TNode>> GetChains(IGraph<TNode> graph)
Parameters
Type Name Description
IGraph<TNode> graph
Returns
Type Description
System.Collections.Generic.List<Chain<TNode>>
Overrides
Edgar.Legacy.Core.ChainDecompositions.ChainDecompositionBase<TNode>.GetChains(Edgar.Graphs.IGraph<TNode>)

Implements