com.jgraph.layout
public class JGraphModelFacade extends JGraphFacade
Constructor Summary | |
---|---|
JGraphModelFacade(GraphModel model)
Constructs a JGraphGraphFacade specifying the graph passed in as the
input graph
| |
JGraphModelFacade(GraphModel model, Object[] roots)
Constructs a JGraphGraphFacade specifying the graph passed in as the
input graph
| |
JGraphModelFacade(GraphModel model, Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed)
Constructs a JGraphGraphFacade
| |
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. |
Method Summary | |
---|---|
Rectangle2D | getGraphBounds()
Returns the minimal rectangular bounds that enclose all the elements in
the bounds map. |
List | getIncomingEdges(Object cell, Set exclude, boolean visibleCells, boolean selfLoops)
Returns the incoming edges for cell. |
List | getNeighbours(Object cell, boolean ordered)
A shortcut method that calls getNeighbours with no cells to exclude.
|
List | getNeighbours(Object cell, Set exclude, boolean ordered)
Returns a collection of cells that are connected to the specified cell by
edges. |
List | getOutgoingEdges(Object cell, Set exclude, boolean visibleCells, boolean selfLoops)
Returns the outgoing edges for cell. |
Parameters: model the GraphModel to be laid out
Parameters: model the JGraph to be laid out roots the root vertices to be used by tree layouts. This is not the same thing as the roots of the graph model.
See Also: (GraphModel, Object[], boolean, boolean, boolean, boolean,
JGraphCostFunction, JGraphAlgebra)
Parameters: model The graph used as input to the layout roots the root vertices to be used by tree layouts ignoresHiddenCells ignoresCellsInGroups ignoresUnconnectedCells directed distanceCostFunction the cost function that defines the distance metrics algebra the algebra used for basic algorithms and functions
See Also: JGraphModelFacade JGraphModelFacade JGraphModelFacade JGraphModelFacade JGraphModelFacade
bounds
map. After a layout has completed this method
will return the collective bounds of the new laid out graph.
Returns: null
Parameters: cell The cell from which the incoming edges will be determined exclude The set of edges to ignore when searching visibleCells whether or not only visible cells should be processed selfLoops whether or not to include self loops in the returned list
Returns: Returns the list of incoming edges for cell
See Also: JGraphModelFacade
Parameters: cell
The cell from which the neighbours will be determined exclude
The set of cells to ignore when searching ordered
whether or not to order the returned value in the order of the
current order
comparator. Be very careful
using the default comparator on the default graph model,
getIndexOfRoot
has linear performance and so
sorting the entire model roots will have quadratic
performance.
Returns: Returns the set of neighbours for cell
Parameters: cell The cell from which the outgoing edges will be determined exclude The set of edges to ignore when searching visibleCells whether or not only visible cells should be processed selfLoops whether or not to include self loops in the returned list
Returns: Returns the list of outgoing edges for cell