This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree.
Interface Summary Interface Description mxICostFunctionThe cost function takes a cell and returns it's cost as a double.
Class Summary Class Description mxAnalysisGraphImplements a collection of utility methods abstracting the graph structure taking into account graph properties such as visible/non-visible traversal mxConstantCostFunctionImplements a cost function for a constant cost per traversed cell. mxDistanceCostFunctionImplements a cost function for the Euclidean length of an edge. mxFibonacciHeapThis class implements a priority queue. mxFibonacciHeap.NodeImplements a node of the Fibonacci heap. mxGraphAnalysisA singleton class that provides algorithms for graphs. mxGraphGenerator mxGraphPropertiesConstants for graph structure properties mxGraphStructure mxTraversalImplements a collection of utility methods for traversing the graph structure. mxUnionFindImplements a union find structure that uses union by rank and path compression.
Enum Summary Enum Description mxGraphProperties.GraphType
Exception Summary Exception Description StructuralException