Package com.mxgraph.analysis
package com.mxgraph.analysis
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
-
ClassDescriptionImplements a collection of utility methods abstracting the graph structure taking into account graph properties such as visible/non-visible traversalImplements a cost function for a constant cost per traversed cell.Implements a cost function for the Euclidean length of an edge.This class implements a priority queue.Implements a node of the Fibonacci heap.A singleton class that provides algorithms for graphs.Constants for graph structure propertiesThe cost function takes a cell and returns it's cost as a double.Implements a collection of utility methods for traversing the graph structure.Implements a union find structure that uses union by rank and path compression.