| Package | Description |
|---|---|
| com.mxgraph.analysis |
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
|
| Modifier and Type | Method | Description |
|---|---|---|
static boolean |
mxGraphStructure.areConnected(mxAnalysisGraph aGraph,
java.lang.Object sourceVertex,
java.lang.Object targetVertex) |
|
static java.util.List<java.util.Map<java.lang.Object,java.lang.Object>> |
mxTraversal.bellmanFord(mxAnalysisGraph aGraph,
java.lang.Object startVertex) |
Implements the Bellman-Ford shortest path from startVertex to all vertices.
|
static void |
mxTraversal.bfs(mxAnalysisGraph aGraph,
java.lang.Object startVertex,
mxGraph.mxICellVisitor visitor) |
Implements a recursive breadth first search starting from the specified
cell.
|
static void |
mxGraphStructure.complementaryGraph(mxAnalysisGraph aGraph) |
Makes the complement of aGraph
|
static void |
mxTraversal.dfs(mxAnalysisGraph aGraph,
java.lang.Object startVertex,
mxGraph.mxICellVisitor visitor) |
Implements a recursive depth first search starting from the specified
cell.
|
static void |
mxTraversal.dijkstra(mxAnalysisGraph aGraph,
java.lang.Object startVertex,
java.lang.Object endVertex,
mxGraph.mxICellVisitor visitor) |
Implements the Dijkstra's shortest path from startVertex to endVertex.
|
static java.util.ArrayList<java.lang.Object[][]> |
mxTraversal.floydRoyWarshall(mxAnalysisGraph aGraph) |
Implements the Floyd-Roy-Warshall (aka WFI) shortest path algorithm between all vertices.
|
void |
mxGraphGenerator.getBipartiteGraph(mxAnalysisGraph aGraph,
int numVerticesGroup1,
int numVerticesGroup2) |
|
void |
mxGraphGenerator.getCompleteBipartiteGraph(mxAnalysisGraph aGraph,
int numVerticesGroup1,
int numVerticesGroup2) |
|
void |
mxGraphGenerator.getCompleteGraph(mxAnalysisGraph aGraph,
int numVertices) |
|
static java.lang.Object |
mxGraphStructure.getConnectingEdge(mxAnalysisGraph aGraph,
java.lang.Object vertexOne,
java.lang.Object vertexTwo) |
|
static java.lang.Object[] |
mxGraphStructure.getCutEdges(mxAnalysisGraph aGraph) |
|
static java.lang.Object[] |
mxGraphStructure.getCutVertices(mxAnalysisGraph aGraph) |
|
static java.lang.Object |
mxGraphStructure.getDirectedLeaf(mxAnalysisGraph aGraph,
java.lang.Object parent) |
|
void |
mxGraphGenerator.getFriendshipWindmillGraph(mxAnalysisGraph aGraph,
int numBranches,
int branchSize) |
|
static java.lang.Object[][] |
mxGraphStructure.getGraphComponents(mxAnalysisGraph aGraph) |
|
void |
mxGraphGenerator.getGridGraph(mxAnalysisGraph aGraph,
int numColumns,
int numRows) |
|
void |
mxGraphGenerator.getKingGraph(mxAnalysisGraph aGraph,
int xDim,
int yDim) |
|
java.lang.Object[] |
mxGraphGenerator.getKingMoveVertexes(mxAnalysisGraph aGraph,
int xDim,
int yDim,
int xCoord,
int yCoord) |
|
void |
mxGraphGenerator.getKnightGraph(mxAnalysisGraph aGraph,
int xDim,
int yDim) |
|
java.lang.Object[] |
mxGraphGenerator.getKnightMoveVertexes(mxAnalysisGraph aGraph,
int xDim,
int yDim,
int xCoord,
int yCoord) |
|
void |
mxGraphGenerator.getKnightTour(mxAnalysisGraph aGraph,
int xDim,
int yDim,
int startVertexValue) |
|
static java.lang.Object |
mxGraphStructure.getLowestDegreeVertex(mxAnalysisGraph aGraph,
java.lang.Object[] omitVertex) |
|
java.lang.Double |
mxGraphGenerator.getNewEdgeValue(mxAnalysisGraph aGraph) |
Creates a new edge value based on graph properties in mxAnalysisGraph.
|
void |
mxGraphGenerator.getNullGraph(mxAnalysisGraph aGraph,
int numVertices) |
|
void |
mxGraphGenerator.getPathGraph(mxAnalysisGraph aGraph,
int numVertices) |
|
void |
mxGraphGenerator.getPetersenGraph(mxAnalysisGraph aGraph) |
|
void |
mxGraphGenerator.getSimpleRandomGraph(mxAnalysisGraph aGraph,
int numNodes,
int numEdges,
boolean allowSelfLoops,
boolean allowMultipleEdges,
boolean forceConnected) |
Generates a random graph
|
void |
mxGraphGenerator.getSimpleRandomTree(mxAnalysisGraph aGraph,
int vertexCount) |
Generates a random tree graph
|
static java.lang.Object[] |
mxGraphStructure.getSinkVertices(mxAnalysisGraph aGraph) |
|
static java.lang.Object[] |
mxGraphStructure.getSourceVertices(mxAnalysisGraph aGraph) |
|
void |
mxGraphGenerator.getStarGraph(mxAnalysisGraph aGraph,
int numVertices) |
|
static java.lang.Object |
mxGraphStructure.getVertexWithValue(mxAnalysisGraph aGraph,
int value) |
|
static java.lang.Object[] |
mxTraversal.getWFIPath(mxAnalysisGraph aGraph,
java.util.ArrayList<java.lang.Object[][]> FWIresult,
java.lang.Object startVertex,
java.lang.Object targetVertex) |
This method helps the user to get the desired data from the result of the Floyd-Roy-Warshall algorithm.
|
void |
mxGraphGenerator.getWheelGraph(mxAnalysisGraph aGraph,
int numVertices) |
|
void |
mxGraphGenerator.getWindmillGraph(mxAnalysisGraph aGraph,
int numBranches,
int branchSize) |
|
static int |
mxGraphStructure.indegree(mxAnalysisGraph aGraph,
java.lang.Object vertex) |
|
static boolean |
mxGraphStructure.isBiconnected(mxAnalysisGraph aGraph) |
|
static boolean |
mxGraphStructure.isConnected(mxAnalysisGraph aGraph) |
|
static boolean |
mxGraphStructure.isCutEdge(mxAnalysisGraph aGraph,
java.lang.Object edge) |
|
static boolean |
mxGraphStructure.isCutVertex(mxAnalysisGraph aGraph,
java.lang.Object vertex) |
|
static boolean |
mxGraphStructure.isCyclicDirected(mxAnalysisGraph aGraph) |
|
static boolean |
mxGraphStructure.isCyclicUndirected(mxAnalysisGraph aGraph) |
|
static boolean |
mxGraphStructure.isSimple(mxAnalysisGraph aGraph) |
|
static boolean |
mxGraphStructure.isTree(mxAnalysisGraph aGraph) |
|
static void |
mxGraphStructure.makeConnected(mxAnalysisGraph aGraph) |
Makes the graph connected
|
static void |
mxGraphStructure.makeSimple(mxAnalysisGraph aGraph) |
|
static void |
mxGraphStructure.makeTreeDirected(mxAnalysisGraph aGraph,
java.lang.Object startVertex) |
Makes a tree graph directed from the source to the leaves
|
void |
mxGraphGenerator.oneSpanningTree(mxAnalysisGraph aGraph,
boolean forceConnected,
boolean forceSimple) |
|
static int |
mxGraphStructure.outdegree(mxAnalysisGraph aGraph,
java.lang.Object vertex) |
|
static int |
mxGraphStructure.regularity(mxAnalysisGraph aGraph) |
|
void |
mxGraphGenerator.setBipartiteGraphSpacing(mxAnalysisGraph aGraph,
int numVerticesGroup1,
int numVerticesGroup2,
double vertexSpacing,
double groupSpacing) |
Sets the physical spacing between vertices in a bipartite graph.
|
static void |
mxGraphStructure.setDefaultGraphStyle(mxAnalysisGraph aGraph,
boolean resetEdgeValues) |
Sets the style of the graph to that as in GraphEditor
|
void |
mxGraphGenerator.setGridGraphSpacing(mxAnalysisGraph aGraph,
double xSpacing,
double ySpacing,
int numColumns,
int numRows) |
Sets the physical spacing between vertices in a grid graph.
|
void |
mxGraphGenerator.setPathGraphSpacing(mxAnalysisGraph aGraph,
double spacing) |
Sets the physical spacing between vertices in a path graph.
|
void |
mxGraphGenerator.setStarGraphLayout(mxAnalysisGraph aGraph,
double graphSize) |
Sets the physical size of a star graph.
|
void |
mxGraphGenerator.setWindmillGraphLayout(mxAnalysisGraph aGraph,
int numBranches,
int numVerticesInBranch,
double graphSize) |
Sets the layout of a windmill graph.
|
Copyright (c) 2010-2017 Gaudenz Alder, JGraph Ltd. All rights reserved.