| Package | Description |
|---|---|
| com.mxgraph.analysis |
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
|
| com.mxgraph.costfunction | |
| com.mxgraph.generatorfunction |
| Class and Description |
|---|
| mxAnalysisGraph
Implements a collection of utility methods abstracting the graph structure
taking into account graph properties such as visible/non-visible traversal
|
| mxFibonacciHeap
This class implements a priority queue.
|
| mxFibonacciHeap.Node
Implements a node of the Fibonacci heap.
|
| mxGraphAnalysis
A singleton class that provides algorithms for graphs.
|
| mxGraphGenerator |
| mxGraphProperties.GraphType |
| mxICostFunction
The cost function takes a cell and returns it's cost as a double.
|
| mxUnionFind
Implements a union find structure that uses union by rank and path
compression.
|
| mxUnionFind.Node
A class that defines the identity of a set.
|
| StructuralException |
| Class and Description |
|---|
| mxICostFunction
The cost function takes a cell and returns it's cost as a double.
|
| Class and Description |
|---|
| mxICostFunction
The cost function takes a cell and returns it's cost as a double.
|
Copyright (c) 2010 Gaudenz Alder. All rights reserved.