|
JGraph X 2.1.0.7 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectcom.mxgraph.analysis.mxGraphStructure
public class mxGraphStructure
| Constructor Summary | |
|---|---|
mxGraphStructure()
|
|
| Method Summary | |
|---|---|
static boolean |
areConnected(mxAnalysisGraph aGraph,
Object sourceVertex,
Object targetVertex)
|
static void |
complementaryGraph(mxAnalysisGraph aGraph)
Makes the complement of aGraph |
static Object |
getConnectingEdge(mxAnalysisGraph aGraph,
Object vertexOne,
Object vertexTwo)
|
static Object[] |
getCutEdges(mxAnalysisGraph aGraph)
|
static Object[] |
getCutVertices(mxAnalysisGraph aGraph)
|
static Object |
getDirectedLeaf(mxAnalysisGraph aGraph,
Object parent)
|
static Object[][] |
getGraphComponents(mxAnalysisGraph aGraph)
|
static Object |
getLowestDegreeVertex(mxAnalysisGraph aGraph,
Object[] omitVertex)
|
static Object[] |
getSinkVertices(mxAnalysisGraph aGraph)
|
static Object[] |
getSourceVertices(mxAnalysisGraph aGraph)
|
static Object |
getVertexWithValue(mxAnalysisGraph aGraph,
int value)
|
static int |
indegree(mxAnalysisGraph aGraph,
Object vertex)
|
static boolean |
isBiconnected(mxAnalysisGraph aGraph)
|
static boolean |
isConnected(mxAnalysisGraph aGraph)
|
static boolean |
isCutEdge(mxAnalysisGraph aGraph,
Object edge)
|
static boolean |
isCutVertex(mxAnalysisGraph aGraph,
Object vertex)
|
static boolean |
isCyclicDirected(mxAnalysisGraph aGraph)
|
static boolean |
isCyclicUndirected(mxAnalysisGraph aGraph)
|
static boolean |
isSimple(mxAnalysisGraph aGraph)
|
static boolean |
isTree(mxAnalysisGraph aGraph)
|
static void |
makeConnected(mxAnalysisGraph aGraph)
Makes the graph connected |
static void |
makeSimple(mxAnalysisGraph aGraph)
|
static void |
makeTreeDirected(mxAnalysisGraph aGraph,
Object startVertex)
Makes a tree graph directed from the source to the leaves |
static int |
outdegree(mxAnalysisGraph aGraph,
Object vertex)
|
static int |
regularity(mxAnalysisGraph aGraph)
|
static void |
setDefaultGraphStyle(mxAnalysisGraph aGraph,
boolean resetEdgeValues)
Sets the style of the graph to that as in GraphEditor |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public mxGraphStructure()
| Method Detail |
|---|
public static boolean isConnected(mxAnalysisGraph aGraph)
aGraph -
public static boolean isCyclicUndirected(mxAnalysisGraph aGraph)
aGraph - parent -
public static boolean isSimple(mxAnalysisGraph aGraph)
aGraph -
public static boolean isTree(mxAnalysisGraph aGraph)
aGraph -
public static Object getLowestDegreeVertex(mxAnalysisGraph aGraph,
Object[] omitVertex)
aGraph - omitVertex - vertices in this array will be omitted, set this parameter to null if you don't want this feature
public static boolean areConnected(mxAnalysisGraph aGraph,
Object sourceVertex,
Object targetVertex)
graph - sourceVertex - targetVertex -
public static void makeSimple(mxAnalysisGraph aGraph)
graph - Make a graph simple (remove parallel edges and self loops)public static void makeConnected(mxAnalysisGraph aGraph)
aGraph - public static Object[][] getGraphComponents(mxAnalysisGraph aGraph)
aGraph -
public static void makeTreeDirected(mxAnalysisGraph aGraph,
Object startVertex)
throws StructuralException
aGraph - startVertex - - this vertex will be root of the tree (the only source node)
StructuralException - - the graph must be a tree (edge direction doesn't matter)
public static Object getConnectingEdge(mxAnalysisGraph aGraph,
Object vertexOne,
Object vertexTwo)
aGraph - vertexOne - vertexTwo -
public static boolean isCyclicDirected(mxAnalysisGraph aGraph)
graph -
public static Object getDirectedLeaf(mxAnalysisGraph aGraph,
Object parent)
graph - parent - properties -
public static void complementaryGraph(mxAnalysisGraph aGraph)
aGraph -
public static Object getVertexWithValue(mxAnalysisGraph aGraph,
int value)
aGraph - - the graph to searchvalue - - desired value
public static void setDefaultGraphStyle(mxAnalysisGraph aGraph,
boolean resetEdgeValues)
aGraph - resetEdgeValues - - set to true if you want to re-generate edge weights
public static int regularity(mxAnalysisGraph aGraph)
throws StructuralException
aGraph -
StructuralException - if the graph is irregular
public static int indegree(mxAnalysisGraph aGraph,
Object vertex)
aGraph - vertex -
public static int outdegree(mxAnalysisGraph aGraph,
Object vertex)
aGraph - vertex -
public static boolean isCutVertex(mxAnalysisGraph aGraph,
Object vertex)
aGraph - vertex -
public static Object[] getCutVertices(mxAnalysisGraph aGraph)
aGraph -
public static boolean isCutEdge(mxAnalysisGraph aGraph,
Object edge)
aGraph - edge -
public static Object[] getCutEdges(mxAnalysisGraph aGraph)
aGraph -
public static Object[] getSourceVertices(mxAnalysisGraph aGraph)
throws StructuralException
aGraph -
StructuralException - the graph must be directed
public static Object[] getSinkVertices(mxAnalysisGraph aGraph)
throws StructuralException
aGraph -
StructuralException - the graph must be directedpublic static boolean isBiconnected(mxAnalysisGraph aGraph)
aGraph -
|
JGraph X 2.1.0.7 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||