MindFusion.Diagramming.PathFinder Members | JavaScript Diagram Library | Documentation

PathFinder Members

Constructors Methods

CollapseAll image

Members Options: Show All

Include Inherited Members
Include Protected Members

Provides methods that help you find paths and cycles in a graph.

The following tables list the members exposed by the PathFinder type.

Public Constructors

	Name	Description
	PathFinder	Initializes a new instance of the PathFinder class.

Public Methods

	Name	Description
	findAllCycles	Finds all cycles in the underlying diagram.
	findAllPaths	Finds and returns all paths that exist between two DiagramNode objects.
	findCycle	Detects whether the specified DiagramNode participates in a cycle.
	findLongestPath	Finds the longest path between the specified DiagramNode objects.
	findShortestPath	Finds the shortest path between two DiagramNode elements, optionally considering the Weight of nodes and / or links.
	findShortestRoute	Calculates a route that passes through all nodes of the diagram, using only existing links. This implementation of the Traveling Salesperson Problem uses the nearest-neighbor heuristic.
	generateShortestRoute	Calculates a route that passes through all nodes of the diagram. This implementation of the Traveling Salesperson Problem uses the nearest-neighbor heuristic.

See Also

PathFinder Class
MindFusion.Diagramming Namespace