public class mxAnalysisGraph extends Object
Modifier and Type | Field and Description |
---|---|
protected mxGraphGenerator |
generator |
protected mxGraph |
graph |
protected Map<String,Object> |
properties |
Constructor and Description |
---|
mxAnalysisGraph() |
Modifier and Type | Method and Description |
---|---|
Object[] |
getChildCells(Object parent,
boolean vertices,
boolean edges) |
Object[] |
getChildEdges(Object parent) |
Object[] |
getChildVertices(Object parent) |
Object[] |
getEdges(Object cell,
Object parent,
boolean includeLoops,
boolean recurse)
Returns the incoming and/or outgoing edges for the given cell.
|
Object[] |
getEdges(Object cell,
Object parent,
boolean incoming,
boolean outgoing,
boolean includeLoops,
boolean recurse)
Returns the incoming and/or outgoing edges for the given cell.
|
mxGraphGenerator |
getGenerator() |
mxGraph |
getGraph() |
Object[] |
getOpposites(Object[] edges,
Object terminal)
Returns all distinct opposite cells for the specified terminal
on the given edges.
|
Object[] |
getOpposites(Object[] edges,
Object terminal,
boolean sources,
boolean targets)
Returns all distinct opposite cells for the specified terminal
on the given edges.
|
Map<String,Object> |
getProperties() |
Object |
getTerminal(Object edge,
boolean isSource) |
void |
setGenerator(mxGraphGenerator generator) |
void |
setGraph(mxGraph graph) |
void |
setProperties(Map<String,Object> properties) |
protected mxGraphGenerator generator
protected mxGraph graph
public Object[] getEdges(Object cell, Object parent, boolean incoming, boolean outgoing, boolean includeLoops, boolean recurse)
cell
- Cell whose edges should be returned.parent
- Optional parent. If specified the opposite end of any edge
must be a child of that parent in order for the edge to be returned. The
recurse parameter specifies whether or not it must be the direct child
or the parent just be an ancestral parent.incoming
- Specifies if incoming edges should be included in the
result.outgoing
- Specifies if outgoing edges should be included in the
result.includeLoops
- Specifies if loops should be included in the result.recurse
- Specifies if the parent specified only need be an ancestral
parent, true
, or the direct parent, false
public Object[] getEdges(Object cell, Object parent, boolean includeLoops, boolean recurse)
cell
- Cell whose edges should be returned.parent
- Optional parent. If specified the opposite end of any edge
must be a child of that parent in order for the edge to be returned. The
recurse parameter specifies whether or not it must be the direct child
or the parent just be an ancestral parent.includeLoops
- Specifies if loops should be included in the result.recurse
- Specifies if the parent specified only need be an ancestral
parent, true
, or the direct parent, false
public Object[] getChildVertices(Object parent)
parent
- the cell whose children will be returnpublic Object[] getChildEdges(Object parent)
parent
- the cell whose child edges will be returnpublic Object getTerminal(Object edge, boolean isSource)
edge
- the whose terminal is being soughtisSource
- whether the source terminal is being soughtpublic Object[] getChildCells(Object parent, boolean vertices, boolean edges)
parent
- vertices
- edges
- public Object[] getOpposites(Object[] edges, Object terminal, boolean sources, boolean targets)
edges
- Edges whose opposite terminals should be returned.terminal
- Terminal that specifies the end whose opposite should be
returned.sources
- Specifies if source terminals should be included in the
result.targets
- Specifies if target terminals should be included in the
result.public Object[] getOpposites(Object[] edges, Object terminal)
edges
- Edges whose opposite terminals should be returned.terminal
- Terminal that specifies the end whose opposite should be
returned.public mxGraph getGraph()
public void setGraph(mxGraph graph)
public mxGraphGenerator getGenerator()
public void setGenerator(mxGraphGenerator generator)
Copyright (c) 2010-2017 Gaudenz Alder, JGraph Ltd. All rights reserved.