Provides algorithms to compute reachability information for directed, acyclic
graphs.
Namespace: yWorks.yFiles.AlgorithmsAssembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 2.1.0.2
Syntax
| C# |
|---|
public class Transitivity |
| Visual Basic |
|---|
Public Class Transitivity |
Remarks
Provides algorithms to compute reachability information for directed, acyclic
graphs. The following algorithms are available:
- transitive closure
- transitive reduction
Inheritance Hierarchy
System..::..Object
yWorks.yFiles.Algorithms..::..Transitivity
yWorks.yFiles.Algorithms..::..Transitivity