Package | Description |
---|---|
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.
|
Modifier and Type | Method and Description |
---|---|
java.lang.Object[] |
JGraphAlgebra.getMinimumSpanningTree(GraphModel model,
java.lang.Object[] v,
JGraphCostFunction cf,
boolean directed)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).
|
java.lang.Object[] |
JGraphAlgebra.getMinimumSpanningTree(GraphModel model,
java.lang.Object[] v,
java.lang.Object[] e,
JGraphCostFunction cf)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).
|
java.lang.Object[] |
JGraphAlgebra.getShortestPath(GraphModel model,
java.lang.Object from,
java.lang.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.
|
java.util.List |
JGraphAlgebra.sort(java.lang.Object[] cells,
JGraphCostFunction cf)
Returns a sorted set for
cells with respect to
cf . |
double |
JGraphAlgebra.sum(java.lang.Object[] cells,
JGraphCostFunction cf)
Returns the sum of all cost for
cells with respect to
cf . |
Modifier and Type | Class and Description |
---|---|
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.
|
Modifier and Type | Field and Description |
---|---|
protected JGraphCostFunction |
JGraphFacade.distanceCostFunction
The default cost function used for shortest path search.
|
Modifier and Type | Method and Description |
---|---|
java.lang.Object[] |
JGraphFacade.getMinimumSpanningTree(java.lang.Object[] v,
JGraphCostFunction cf)
Returns the minimum spanning tree (MST) for the graph defined by G=(E,V).
|
java.lang.Object[] |
JGraphFacade.getPath(java.lang.Object v1,
java.lang.Object v2,
int steps,
JGraphCostFunction cf)
Returns the shortest path connecting
v1 and
v2 wrt cf with traverses no more than
steps edges. |
Constructor and Description |
---|
JGraphFacade(GraphLayoutCache cache,
java.lang.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,
GraphLayoutCache cache,
java.lang.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,
java.lang.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(JGraph graph,
java.lang.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.
|
JGraphModelFacade(GraphModel model,
java.lang.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.
|
Copyright (C) 2001-2009 JGraph Ltd. All rights reserved.