Provides methods that help you find paths and cycles in a graph.
The following tables list the members exposed by the PathFinder type.
Name | Description | |
---|---|---|
![]() |
Overloaded. Initializes a new instance of the PathFinder class. |
Name | Description | |
---|---|---|
![]() |
Enumerates all cycles in the underlying diagram. |
|
![]() |
Overloaded. |
|
![]() |
Finds all cycles in the underlying diagram. |
|
![]() |
Overloaded. |
|
![]() |
Overloaded. Finds a cycle in the underlying diagram. |
|
![]() |
Overloaded. Finds the longest path in the underlying diagram. |
|
![]() |
Overloaded. Finds the shortest path in the underlying diagram. |
MindFusion.Diagramming Developer's Guide | © 2025 MindFusion |