Provides algorithms for solving the rank assignment problem.
Namespace: yWorks.yFiles.AlgorithmsAssembly: yWorks.yFilesNET.Algorithms (in yWorks.yFilesNET.Algorithms.dll) Version: 4.1.0.1 (4.1.0.1)
Syntax
| C# |
|---|
public class RankAssignments |
| Visual Basic |
|---|
Public Class RankAssignments |
Remarks
Provides algorithms for solving the rank assignment problem.
Let G=(V,E) be a directed acyclic graph. Let length(e) denote
the minimal length and weight(e) the weight of an
edge e.
The rank assignment problem is to find values x(v) for all
v in V, such that x(v) - x(w) >= length(v,w) for all (v,w) in E,
and that the sum weight(v,w)*(x(v)-x(w)) over all (v,w) in E
is minimal.
Inheritance Hierarchy
System..::..Object
yWorks.yFiles.Algorithms..::..RankAssignments
yWorks.yFiles.Algorithms..::..RankAssignments