Namespace Edgar.Legacy.Core.ChainDecompositions

Classes

BreadthFirstChainDecomposition<TNode>

Breadth-first search guided chain decomposition

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.

Chain<TNode>

Represents a chain of nodes in a chain decomposition.

ChainDecompositionBase<TNode>

Base class for chain decomposer with some utility functions.

ChainDecompositionConfiguration

Chain decomposition configuration.

TreeComponentStrategy

Chain decomposition strategy.

TwoStageChainDecomposition<TNode>

Chain decomposition for layout generators with two-stage generation.