Uses of Class
com.mxgraph.analysis.mxAnalysisGraph
Packages that use mxAnalysisGraph
Package
Description
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 mxAnalysisGraphModifier and TypeMethodDescriptionstatic booleanmxGraphStructure.areConnected(mxAnalysisGraph aGraph, Object sourceVertex, Object targetVertex) mxTraversal.bellmanFord(mxAnalysisGraph aGraph, Object startVertex) Implements the Bellman-Ford shortest path from startVertex to all vertices.static voidmxTraversal.bfs(mxAnalysisGraph aGraph, Object startVertex, mxGraph.mxICellVisitor visitor) Implements a recursive breadth first search starting from the specified cell.static voidmxGraphStructure.complementaryGraph(mxAnalysisGraph aGraph) Makes the complement of aGraphstatic voidmxTraversal.dfs(mxAnalysisGraph aGraph, Object startVertex, mxGraph.mxICellVisitor visitor) Implements a recursive depth first search starting from the specified cell.static voidmxTraversal.dijkstra(mxAnalysisGraph aGraph, Object startVertex, Object endVertex, mxGraph.mxICellVisitor visitor) Implements the Dijkstra's shortest path from startVertex to endVertex.mxTraversal.floydRoyWarshall(mxAnalysisGraph aGraph) Implements the Floyd-Roy-Warshall (aka WFI) shortest path algorithm between all vertices.voidmxGraphGenerator.getBipartiteGraph(mxAnalysisGraph aGraph, int numVerticesGroup1, int numVerticesGroup2) voidmxGraphGenerator.getCompleteBipartiteGraph(mxAnalysisGraph aGraph, int numVerticesGroup1, int numVerticesGroup2) voidmxGraphGenerator.getCompleteGraph(mxAnalysisGraph aGraph, int numVertices) static ObjectmxGraphStructure.getConnectingEdge(mxAnalysisGraph aGraph, Object vertexOne, Object vertexTwo) static Object[]mxGraphStructure.getCutEdges(mxAnalysisGraph aGraph) static Object[]mxGraphStructure.getCutVertices(mxAnalysisGraph aGraph) static ObjectmxGraphStructure.getDirectedLeaf(mxAnalysisGraph aGraph, Object parent) voidmxGraphGenerator.getFriendshipWindmillGraph(mxAnalysisGraph aGraph, int numBranches, int branchSize) static Object[][]mxGraphStructure.getGraphComponents(mxAnalysisGraph aGraph) voidmxGraphGenerator.getGridGraph(mxAnalysisGraph aGraph, int numColumns, int numRows) voidmxGraphGenerator.getKingGraph(mxAnalysisGraph aGraph, int xDim, int yDim) Object[]mxGraphGenerator.getKingMoveVertexes(mxAnalysisGraph aGraph, int xDim, int yDim, int xCoord, int yCoord) voidmxGraphGenerator.getKnightGraph(mxAnalysisGraph aGraph, int xDim, int yDim) Object[]mxGraphGenerator.getKnightMoveVertexes(mxAnalysisGraph aGraph, int xDim, int yDim, int xCoord, int yCoord) voidmxGraphGenerator.getKnightTour(mxAnalysisGraph aGraph, int xDim, int yDim, int startVertexValue) static ObjectmxGraphStructure.getLowestDegreeVertex(mxAnalysisGraph aGraph, Object[] omitVertex) mxGraphGenerator.getNewEdgeValue(mxAnalysisGraph aGraph) Creates a new edge value based on graph properties in mxAnalysisGraph.voidmxGraphGenerator.getNullGraph(mxAnalysisGraph aGraph, int numVertices) voidmxGraphGenerator.getPathGraph(mxAnalysisGraph aGraph, int numVertices) voidmxGraphGenerator.getPetersenGraph(mxAnalysisGraph aGraph) voidmxGraphGenerator.getSimpleRandomGraph(mxAnalysisGraph aGraph, int numNodes, int numEdges, boolean allowSelfLoops, boolean allowMultipleEdges, boolean forceConnected) Generates a random graphvoidmxGraphGenerator.getSimpleRandomTree(mxAnalysisGraph aGraph, int vertexCount) Generates a random tree graphstatic Object[]mxGraphStructure.getSinkVertices(mxAnalysisGraph aGraph) static Object[]mxGraphStructure.getSourceVertices(mxAnalysisGraph aGraph) voidmxGraphGenerator.getStarGraph(mxAnalysisGraph aGraph, int numVertices) static ObjectmxGraphStructure.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.voidmxGraphGenerator.getWheelGraph(mxAnalysisGraph aGraph, int numVertices) voidmxGraphGenerator.getWindmillGraph(mxAnalysisGraph aGraph, int numBranches, int branchSize) static intmxGraphStructure.indegree(mxAnalysisGraph aGraph, Object vertex) static booleanmxGraphStructure.isBiconnected(mxAnalysisGraph aGraph) static booleanmxGraphStructure.isConnected(mxAnalysisGraph aGraph) static booleanmxGraphStructure.isCutEdge(mxAnalysisGraph aGraph, Object edge) static booleanmxGraphStructure.isCutVertex(mxAnalysisGraph aGraph, Object vertex) static booleanmxGraphStructure.isCyclicDirected(mxAnalysisGraph aGraph) static booleanmxGraphStructure.isCyclicUndirected(mxAnalysisGraph aGraph) static booleanmxGraphStructure.isSimple(mxAnalysisGraph aGraph) static booleanmxGraphStructure.isTree(mxAnalysisGraph aGraph) static voidmxGraphStructure.makeConnected(mxAnalysisGraph aGraph) Makes the graph connectedstatic voidmxGraphStructure.makeSimple(mxAnalysisGraph aGraph) static voidmxGraphStructure.makeTreeDirected(mxAnalysisGraph aGraph, Object startVertex) Makes a tree graph directed from the source to the leavesvoidmxGraphGenerator.oneSpanningTree(mxAnalysisGraph aGraph, boolean forceConnected, boolean forceSimple) static intmxGraphStructure.outdegree(mxAnalysisGraph aGraph, Object vertex) static intmxGraphStructure.regularity(mxAnalysisGraph aGraph) voidmxGraphGenerator.setBipartiteGraphSpacing(mxAnalysisGraph aGraph, int numVerticesGroup1, int numVerticesGroup2, double vertexSpacing, double groupSpacing) Sets the physical spacing between vertices in a bipartite graph.static voidmxGraphStructure.setDefaultGraphStyle(mxAnalysisGraph aGraph, boolean resetEdgeValues) Sets the style of the graph to that as in GraphEditorvoidmxGraphGenerator.setGridGraphSpacing(mxAnalysisGraph aGraph, double xSpacing, double ySpacing, int numColumns, int numRows) Sets the physical spacing between vertices in a grid graph.voidmxGraphGenerator.setPathGraphSpacing(mxAnalysisGraph aGraph, double spacing) Sets the physical spacing between vertices in a path graph.voidmxGraphGenerator.setStarGraphLayout(mxAnalysisGraph aGraph, double graphSize) Sets the physical size of a star graph.voidmxGraphGenerator.setWindmillGraphLayout(mxAnalysisGraph aGraph, int numBranches, int numVerticesInBranch, double graphSize) Sets the layout of a windmill graph.