Creates a transitive closure of the input graph

Namespace:  QuickGraph.Algorithms
Assembly:  QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1514 (2.4.2.1514)

Syntax

C#
public class TransitiveClosureAlgorithm : IAlgorithm
Visual Basic (Declaration)
Public Class TransitiveClosureAlgorithm _
	Implements IAlgorithm

Remarks

The core algorithm for Transitive Closure (TC) is inspired by the Boost Graph Library implementation and Nuutila, E's work "Efficient Transitive Closure Computation in Large Digraphs".

Event InitTransitiveClosureVertex is raised when a new vertex is added to the TC graph. It maps a vertex in the original graph to the corresponding vertex in the TC graph

Event ExamineEdge is rasied when an edge is added to the TC graph

Inheritance Hierarchy

System..::.Object
  QuickGraph.Algorithms..::.TransitiveClosureAlgorithm

See Also