|
JGraph |
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use JGraphCostFunction | |
com.jgraph.algebra | JGraphLayout algebra package which contains graph algorithms and datastructures. |
com.jgraph.algebra.cost | JGraphLayout cost package defines a cost function and default implementations. |
com.jgraph.layout | JGraphLayout's topmost package which contains the basic layout classes and interfaces. |
Uses of JGraphCostFunction in com.jgraph.algebra |
Methods in com.jgraph.algebra with parameters of type JGraphCostFunction | |
Object[] |
JGraphAlgebra.getShortestPath(GraphModel model,
Object from,
Object to,
JGraphCostFunction 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. |
Object[] |
JGraphAlgebra.getMinimumSpanningTree(GraphModel model,
Object[] v,
JGraphCostFunction cf,
boolean directed)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V). |
Object[] |
JGraphAlgebra.getMinimumSpanningTree(GraphModel model,
Object[] v,
Object[] e,
JGraphCostFunction cf)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V). |
List |
JGraphAlgebra.sort(Object[] cells,
JGraphCostFunction cf)
Returns a sorted set for cells with respect to
cf . |
double |
JGraphAlgebra.sum(Object[] cells,
JGraphCostFunction cf)
Returns the sum of all cost for cells with respect to
cf . |
Uses of JGraphCostFunction in com.jgraph.algebra.cost |
Classes in com.jgraph.algebra.cost that implement JGraphCostFunction | |
class |
JGraphConstantCostFunction
This allows to recursively compose any number of abstract layouts into a compound abstract layout. |
class |
JGraphDistanceCostFunction
This class implements a priority queue. |
Uses of JGraphCostFunction in com.jgraph.layout |
Fields in com.jgraph.layout declared as JGraphCostFunction | |
protected JGraphCostFunction |
JGraphFacade.distanceCostFunction
The default cost function used for shortest path search. |
Methods in com.jgraph.layout with parameters of type JGraphCostFunction | |
Object[] |
JGraphFacade.getPath(Object v1,
Object v2,
int steps,
JGraphCostFunction cf)
Returns the shortest path connecting v1 and
v2 wrt cf with traverses no more than
steps edges. |
Object[] |
JGraphFacade.getMinimumSpanningTree(Object[] v,
JGraphCostFunction cf)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V). |
Constructors in com.jgraph.layout with parameters of type JGraphCostFunction | |
JGraphModelFacade(GraphModel model,
Object[] roots,
boolean ignoresHiddenCells,
boolean ignoresCellsInGroups,
boolean ignoresUnconnectedCells,
boolean directed,
JGraphCostFunction distanceCostFunction,
JGraphAlgebra algebra)
Creates a JGraphGraphFacade specifying the graph passed in as the input graph. |
|
JGraphFacade(JGraph graph,
Object[] roots,
boolean ignoresHiddenCells,
boolean ignoresCellsInGroups,
boolean ignoresUnconnectedCells,
boolean directed,
JGraphCostFunction distanceCostFunction,
JGraphAlgebra algebra)
Creates a JGraphGraphFacade specifying the graph passed in as the input graph. |
|
JGraphFacade(GraphLayoutCache cache,
Object[] roots,
boolean ignoresHiddenCells,
boolean ignoresCellsInGroups,
boolean ignoresUnconnectedCells,
boolean directed,
JGraphCostFunction distanceCostFunction,
JGraphAlgebra algebra)
Creates a JGraphFacade specifying the graph passed in as the input graph. |
|
JGraphFacade(GraphModel model,
Object[] roots,
boolean ignoresHiddenCells,
boolean ignoresCellsInGroups,
boolean ignoresUnconnectedCells,
boolean directed,
JGraphCostFunction distanceCostFunction,
JGraphAlgebra algebra)
Creates a JGraphGenericFacade specifying the graph passed in as the input graph. |
|
JGraphFacade(GraphModel model,
GraphLayoutCache cache,
Object[] roots,
boolean ignoresHiddenCells,
boolean ignoresCellsInGroups,
boolean ignoresUnconnectedCells,
boolean directed,
JGraphCostFunction distanceCostFunction,
JGraphAlgebra algebra)
Creates a JGraphGenericFacade specifying the graph passed in as the input graph. |
|
JGraph |
||||||||||
PREV NEXT | FRAMES NO FRAMES |