Uses of Class
com.mxgraph.analysis.mxAnalysisGraph

Packages that use mxAnalysisGraph

Package	Description
com.mxgraph.analysis	This package provides various algorithms for graph analysis, such as shortest path and minimum spanning tree.

Uses of mxAnalysisGraph in com.mxgraph.analysis

Methods in com.mxgraph.analysis with parameters of type mxAnalysisGraph

Modifier and Type	Method and Description
static boolean	mxGraphStructure.areConnected(mxAnalysisGraph aGraph, Object sourceVertex, Object targetVertex)
static List<Map<Object,Object>>	mxTraversal.bellmanFord(mxAnalysisGraph aGraph, Object startVertex) Implements the Bellman-Ford shortest path from startVertex to all vertices.
static void	mxTraversal.bfs(mxAnalysisGraph aGraph, 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, Object startVertex, mxGraph.mxICellVisitor visitor) Implements a recursive depth first search starting from the specified cell.
static void	mxTraversal.dijkstra(mxAnalysisGraph aGraph, Object startVertex, Object endVertex, mxGraph.mxICellVisitor visitor) Implements the Dijkstra's shortest path from startVertex to endVertex.
static ArrayList<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 Object	mxGraphStructure.getConnectingEdge(mxAnalysisGraph aGraph, Object vertexOne, Object vertexTwo)
static Object[]	mxGraphStructure.getCutEdges(mxAnalysisGraph aGraph)
static Object[]	mxGraphStructure.getCutVertices(mxAnalysisGraph aGraph)
static Object	mxGraphStructure.getDirectedLeaf(mxAnalysisGraph aGraph, Object parent)
void	mxGraphGenerator.getFriendshipWindmillGraph(mxAnalysisGraph aGraph, int numBranches, int branchSize)
static Object[][]	mxGraphStructure.getGraphComponents(mxAnalysisGraph aGraph)
void	mxGraphGenerator.getGridGraph(mxAnalysisGraph aGraph, int numColumns, int numRows)
void	mxGraphGenerator.getKingGraph(mxAnalysisGraph aGraph, int xDim, int yDim)
Object[]	mxGraphGenerator.getKingMoveVertexes(mxAnalysisGraph aGraph, int xDim, int yDim, int xCoord, int yCoord)
void	mxGraphGenerator.getKnightGraph(mxAnalysisGraph aGraph, int xDim, int yDim)
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 Object	mxGraphStructure.getLowestDegreeVertex(mxAnalysisGraph aGraph, Object[] omitVertex)
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 Object[]	mxGraphStructure.getSinkVertices(mxAnalysisGraph aGraph)
static Object[]	mxGraphStructure.getSourceVertices(mxAnalysisGraph aGraph)
void	mxGraphGenerator.getStarGraph(mxAnalysisGraph aGraph, int numVertices)
static Object	mxGraphStructure.getVertexWithValue(mxAnalysisGraph aGraph, int value)
static Object[]	mxTraversal.getWFIPath(mxAnalysisGraph aGraph, ArrayList<Object[][]> FWIresult, Object startVertex, 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, Object vertex)
static boolean	mxGraphStructure.isBiconnected(mxAnalysisGraph aGraph)
static boolean	mxGraphStructure.isConnected(mxAnalysisGraph aGraph)
static boolean	mxGraphStructure.isCutEdge(mxAnalysisGraph aGraph, Object edge)
static boolean	mxGraphStructure.isCutVertex(mxAnalysisGraph aGraph, 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, 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, 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.