public class JGraphModelFacade extends JGraphFacade
JGraphFacade.CellVisitor, JGraphFacade.DefaultComparator
algebra, attributes, circleRadiusFactor, directed, distanceCostFunction, edgePromotion, graph, graphLayoutCache, groupHierarchies, ignoresCellsInGroups, ignoresHiddenCells, ignoresUnconnectedCells, model, order, ordered, roots, verticesFilter
Constructor and Description |
---|
JGraphModelFacade(GraphModel model)
Constructs a JGraphGraphFacade specifying the graph passed in as the
input graph
|
JGraphModelFacade(GraphModel model,
java.lang.Object[] roots)
Constructs 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)
Constructs a JGraphGraphFacade
|
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.
|
Modifier and Type | Method and Description |
---|---|
java.awt.geom.Rectangle2D |
getGraphBounds()
Returns the minimal rectangular bounds that enclose all the elements in
the
bounds map. |
java.util.List |
getIncomingEdges(java.lang.Object cell,
java.util.Set exclude,
boolean visibleCells,
boolean selfLoops)
Returns the incoming edges for cell.
|
java.util.List |
getNeighbours(java.lang.Object cell,
boolean ordered)
A shortcut method that calls getNeighbours with no cells to exclude.
|
java.util.List |
getNeighbours(java.lang.Object cell,
java.util.Set exclude,
boolean ordered)
Returns a collection of cells that are connected to the specified cell by
edges.
|
java.util.List |
getOutgoingEdges(java.lang.Object cell,
java.util.Set exclude,
boolean visibleCells,
boolean selfLoops)
Returns the outgoing edges for cell.
|
bfs, circle, createNestedMap, createNestedMap, createNestedMap, determineLayoutHierarchies, dfs, dfs, dfs, disableRouting, findTreeRoots, getAll, getAttributes, getAttributes, getBounds, getBounds, getBounds, getCellBounds, getCells, getCellView, getCircleRadiusFactor, getComponents, getConnectionComponents, getDistance, getEdges, getEdges, getEdges, getEdgesBetween, getGraphOrigin, getGroupHierarchies, getLength, getLocation, getLocations, getMaxSize, getMinimumSpanningTree, getOrder, getPath, getPoints, getRootAt, getRootCount, getRoots, getSize, getSource, getSourcePort, getTarget, getTargetPort, getUnconnectedVertices, getVertices, getVertices, getVerticesFilter, isDirected, isEdge, isEdgePromotion, IsIgnoresCellsInGroups, isIgnoresHiddenCells, isIgnoresUnconnectedCells, isMoveable, isOrdered, isRoot, isVertex, norm, populateGroupHierarchies, randomize, resetControlPoints, resetControlPoints, run, scale, scale, setAttributes, setAttributes, setBounds, setBounds, setBounds, setCircleRadiusFactor, setDirected, setEdgePromotion, setGroupHierarchies, setIgnoresCellsInGroups, setIgnoresHiddenCells, setIgnoresUnconnectedCells, setLocation, setLocation, setLocations, setLoggerLevel, setOrder, setOrdered, setPoints, setRoots, setSize, setVerticesFilter, tilt, translate, translateCells
public JGraphModelFacade(GraphModel model)
model
- the GraphModel to be laid outpublic JGraphModelFacade(GraphModel model, java.lang.Object[] roots)
model
- the JGraph to be laid outroots
- the root vertices to be used by tree layouts. This is not the
same thing as the roots of the graph model.public JGraphModelFacade(GraphModel model, java.lang.Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed)
public JGraphModelFacade(GraphModel model, java.lang.Object[] roots, boolean ignoresHiddenCells, boolean ignoresCellsInGroups, boolean ignoresUnconnectedCells, boolean directed, JGraphCostFunction distanceCostFunction, JGraphAlgebra algebra)
model
- The graph used as input to the layoutroots
- the root vertices to be used by tree layoutsignoresHiddenCells
- ignoresCellsInGroups
- ignoresUnconnectedCells
- directed
- distanceCostFunction
- the cost function that defines the distance metricsalgebra
- the algebra used for basic algorithms and functionsJGraphFacade.isVertex(java.lang.Object)
,
JGraphFacade.ignoresHiddenCells
,
JGraphFacade.ignoresCellsInGroups
,
JGraphFacade.ignoresUnconnectedCells
,
JGraphFacade.directed
public java.util.List getNeighbours(java.lang.Object cell, boolean ordered)
getNeighbours
in class JGraphFacade
getNeighbours(Object, Set, boolean)
public java.util.List getNeighbours(java.lang.Object cell, java.util.Set exclude, boolean ordered)
getNeighbours
in class JGraphFacade
cell
- The cell from which the neighbours will be determinedexclude
- The set of cells to ignore when searchingordered
- 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.cell
public java.util.List getOutgoingEdges(java.lang.Object cell, java.util.Set exclude, boolean visibleCells, boolean selfLoops)
getOutgoingEdges
in class JGraphFacade
cell
- The cell from which the outgoing edges will be determinedexclude
- The set of edges to ignore when searchingvisibleCells
- whether or not only visible cells should be processedselfLoops
- whether or not to include self loops in the returned listcell
public java.util.List getIncomingEdges(java.lang.Object cell, java.util.Set exclude, boolean visibleCells, boolean selfLoops)
getIncomingEdges
in class JGraphFacade
cell
- The cell from which the incoming edges will be determinedexclude
- The set of edges to ignore when searchingvisibleCells
- whether or not only visible cells should be processedselfLoops
- whether or not to include self loops in the returned listcell
public java.awt.geom.Rectangle2D getGraphBounds()
bounds
map. After a layout has completed this method
will return the collective bounds of the new laid out graph.getGraphBounds
in class JGraphFacade
null
Copyright (C) 2001-2009 JGraph Ltd. All rights reserved.