Name | Description | |
---|---|---|
Finds all cycles in the underlying diagram. |
||
Finds and returns all paths that exist between two DiagramNode objects. |
||
Detects whether the specified DiagramNode participates in a cycle. |
||
Finds the longest path between the specified DiagramNode objects. |
||
Finds the shortest path between two DiagramNode elements, optionally considering the Weight of nodes and / or links. |
NetDiagram Programmer's Guide | © 2023 MindFusion |