|
JGraphAddons |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--org.jgraph.util.JGraphUtilities
Constructor Summary | |
JGraphUtilities()
|
Method Summary | |
static Rectangle2D |
align(int constraint,
Rectangle2D cellBounds,
Rectangle2D bounds)
|
static void |
alignCells(JGraph graph,
Object[] cells,
int constraint)
|
static void |
applyLayout(JGraph sourceGraph,
JGraphLayoutAlgorithm layout)
|
static void |
connect(JGraph graph,
DefaultGraphCell prototype,
Object[] cells)
|
static CostFunction |
createDefaultCostFunction()
|
static void |
editCells(JGraph graph,
Object[] cells,
AttributeMap attrs)
|
static Object[] |
getAll(JGraph graph)
|
static UnionFind |
getComponents(JGraph graph)
|
static Object[] |
getEdges(JGraph graph)
|
static Object[] |
getEdgesBetween(JGraph graph,
Object vertex1,
Object vertex2)
|
static Object |
getNeighbour(JGraph graph,
Object edge,
Object vertex)
|
static Object[] |
getShortestPath(JGraph graph,
Object from,
Object to,
CostFunction cf)
Returns the ShortestPath. |
static Object |
getSourceVertex(JGraph graph,
Object edge)
|
static Object[] |
getSpanningTree(JGraph graph,
CostFunction cf)
Returns the shortest spanning tree. |
static Object |
getTargetVertex(JGraph graph,
Object edge)
|
static Object[] |
getVertices(JGraph graph,
Object[] cells)
|
static void |
group(JGraph graph,
Object groupCell,
Object[] cells)
|
static boolean |
isGroup(JGraph graph,
Object cell)
|
static boolean |
isNeighbour(JGraph graph,
Object v1,
Object v2)
Returns true if the given vertices are conntected by a single edge in this document. |
static boolean |
isVertex(JGraph graph,
Object cell)
|
static void |
removeCells(JGraph graph,
Object[] cells)
|
static SortedSet |
sort(JGraph graph,
Object[] cells,
CostFunction cf)
|
static BufferedImage |
toImage(JGraph graph,
int inset)
|
static void |
ungroup(JGraph graph,
Object[] cells)
|
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public JGraphUtilities()
Method Detail |
public static BufferedImage toImage(JGraph graph, int inset)
public static Object[] getAll(JGraph graph)
public static Object[] getVertices(JGraph graph, Object[] cells)
public static Object[] getEdges(JGraph graph)
public static Object getNeighbour(JGraph graph, Object edge, Object vertex)
public static Object getSourceVertex(JGraph graph, Object edge)
public static Object getTargetVertex(JGraph graph, Object edge)
public static boolean isVertex(JGraph graph, Object cell)
public static boolean isGroup(JGraph graph, Object cell)
public static void connect(JGraph graph, DefaultGraphCell prototype, Object[] cells)
public static boolean isNeighbour(JGraph graph, Object v1, Object v2)
public static Object[] getEdgesBetween(JGraph graph, Object vertex1, Object vertex2)
public static CostFunction createDefaultCostFunction()
public static UnionFind getComponents(JGraph graph)
public static Object[] getShortestPath(JGraph graph, Object from, Object to, CostFunction cf)
public static Object[] getSpanningTree(JGraph graph, CostFunction cf)
public static SortedSet sort(JGraph graph, Object[] cells, CostFunction cf)
public static void editCells(JGraph graph, Object[] cells, AttributeMap attrs)
public static void removeCells(JGraph graph, Object[] cells)
public static void group(JGraph graph, Object groupCell, Object[] cells)
public static void ungroup(JGraph graph, Object[] cells)
public static void alignCells(JGraph graph, Object[] cells, int constraint)
public static Rectangle2D align(int constraint, Rectangle2D cellBounds, Rectangle2D bounds)
public static void applyLayout(JGraph sourceGraph, JGraphLayoutAlgorithm layout)
|
JGraphAddons |
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |