GreedyCycleRemoval Method

Removes cycles from the input network using a Greedy-Cycle-Removal algorithm. The idea is to induce an order on all nodes in the network (U1, U2, U3, ..., Uk) such that for the majority of links L = (Ui, Uj) it is true that i < j. All links L = (Ui, Uj) such that i > j are reversed.

Syntax

Visual Basic
C#

'Declaration
 
Protected Overridable Sub GreedyCycleRemoval()

protected virtual void GreedyCycleRemoval()

Requirements

Target Platforms: Windows 7, Windows Vista SP1 or later, Windows XP SP3, Windows Server 2008 (Server Core not supported), Windows Server 2008 R2 (Server Core supported with SP1 or later), Windows Server 2003 SP2

Reference

GoLayoutLayeredDigraph Class
GoLayoutLayeredDigraph Members

Send Feedback