Class TransitiveReductionAlgorithm<TVertex, TEdge>

Algorithm that computes the transitive reduction of a graph, which is another directed graph with the same vertices and as few edges as possible.

Inheritance
System.Object
AlgorithmBase<IEdgeListGraph<TVertex, TEdge>>
TransitiveReductionAlgorithm<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
Assembly: QuikGraph.dll
Syntax
public class TransitiveReductionAlgorithm<TVertex, TEdge> : AlgorithmBase<IEdgeListGraph<TVertex, TEdge>>, IAlgorithm<IEdgeListGraph<TVertex, TEdge>>, IComputation, IAlgorithmComponent where TEdge : IEdge<TVertex>
Type Parameters
Name Description
TVertex

Vertex type.
TEdge

Edge type.

Constructors

| Improve this Doc View Source

TransitiveReductionAlgorithm(IEdgeListGraph<TVertex, TEdge>)

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

Declaration
public TransitiveReductionAlgorithm(IEdgeListGraph<TVertex, TEdge> visitedGraph)
Parameters
Type Name Description
IEdgeListGraph<TVertex, TEdge> visitedGraph

Graph to visit.
Exceptions
Type Condition
System.ArgumentNullException

visitedGraph is null.

Properties

| Improve this Doc View Source

TransitiveReduction

Transitive reduction graph.

Declaration
public BidirectionalGraph<TVertex, TEdge> TransitiveReduction { get; }
Property Value
Type Description
BidirectionalGraph<TVertex, TEdge>

Methods

| Improve this Doc View Source

InternalCompute()

Algorithm compute step.

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

Implements

Extension Methods