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.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.getKnightTour(mxAnalysisGraph aGraph,
int xDim,
int yDim,
int startVertexValue) |
|
static java.lang.Object[] |
mxGraphStructure.getSinkVertices(mxAnalysisGraph aGraph) |
|
static java.lang.Object[] |
mxGraphStructure.getSourceVertices(mxAnalysisGraph aGraph) |
|
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.
|
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.regularity(mxAnalysisGraph aGraph) |
|