Uses of Interface
com.mxgraph.analysis.mxICostFunction
Packages that use mxICostFunction
Package
Description
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 mxICostFunctionModifier and TypeClassDescriptionclassImplements a cost function for a constant cost per traversed cell.classImplements a cost function for the Euclidean length of an edge.Methods in com.mxgraph.analysis with parameters of type mxICostFunctionModifier and TypeMethodDescriptionObject[]mxGraphAnalysis.getMinimumSpanningTree(mxGraph graph, Object[] v, mxICostFunction cf, boolean directed) Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).Object[]mxGraphAnalysis.getMinimumSpanningTree(mxGraph graph, Object[] v, Object[] e, mxICostFunction cf) Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).Object[]mxGraphAnalysis.getShortestPath(mxGraph graph, Object from, 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.mxGraphAnalysis.sort(mxCellState[] states, mxICostFunction cf) Returns a sorted set forcellswith respect tocf.doublemxGraphAnalysis.sum(mxCellState[] states, mxICostFunction cf) Returns the sum of all cost forcellswith respect tocf. -
Uses of mxICostFunction in com.mxgraph.costfunction
Classes in com.mxgraph.costfunction that implement mxICostFunctionModifier and TypeClassDescriptionclassclassclassA cost function that assumes that edge value is of type "double" or "String" and returns that value. -
Uses of mxICostFunction in com.mxgraph.generatorfunction
Classes in com.mxgraph.generatorfunction that implement mxICostFunctionModifier and TypeClassDescriptionclassclassclassclass