JGraph X 1.3.0.0

## Uses of Interface
com.mxgraph.analysis.mxICostFunction

Packages that use mxICostFunction
com.mxgraph.analysis: This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree.

Uses of mxICostFunction in com.mxgraph.analysis

Classes in com.mxgraph.analysis that implement mxICostFunction
`class` `mxConstantCostFunction` Implements a cost function for a constant cost per traversed cell.
`class` `mxDistanceCostFunction` Implements a cost function for the Euclidean length of an edge.

Methods in com.mxgraph.analysis with parameters of type mxICostFunction
`java.lang.Object[]` `mxGraphAnalysis.getMinimumSpanningTree(mxGraph graph, java.lang.Object[] v, mxICostFunction cf, boolean directed)` Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).
`java.lang.Object[]` `mxGraphAnalysis.getMinimumSpanningTree(mxGraph graph, java.lang.Object[] v, java.lang.Object[] e, mxICostFunction cf)` Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).
`java.lang.Object[]` `mxGraphAnalysis.getShortestPath(mxGraph graph, java.lang.Object from, java.lang.Object to, mxICostFunction cf, int steps, boolean directed)` Returns the shortest path between two cells or their descendants represented as an array of edges in order of traversal.
`mxCellState[]` `mxGraphAnalysis.sort(mxCellState[] states, mxICostFunction cf)` Returns a sorted set for `cells` with respect to `cf`.
`double` `mxGraphAnalysis.sum(mxCellState[] states, mxICostFunction cf)` Returns the sum of all cost for `cells` with respect to `cf`.

JGraph X 1.3.0.0

Copyright (c) 2008 Gaudenz Alder. All rights reserved.