A IAlgorithm implementation that augments a IMutableVertexAndEdgeListGraph such that for all edge (u,v) there exists the edge (v,u) in the graph.

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

Syntax

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

Remarks

This algorithm can be used to augment a graph with reversed edges to make it usable by a MaximumFlowAlgorithm implementation. It also contains the method to clean up the graph afterwards.

Inheritance Hierarchy

System..::.Object
  QuickGraph.Algorithms.MaximumFlow..::.ReversedEdgeAugmentorAlgorithm

See Also