Uses of Class
com.mxgraph.analysis.StructuralException
Packages that use StructuralException
Package
Description
This package provides various algorithms for graph analysis, such as
shortest path and minimum spanning tree.
-
Uses of StructuralException in com.mxgraph.analysis
Methods in com.mxgraph.analysis that throw StructuralExceptionModifier and TypeMethodDescriptionmxTraversal.bellmanFord
(mxAnalysisGraph aGraph, Object startVertex) Implements the Bellman-Ford shortest path from startVertex to all vertices.static void
mxTraversal.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.void
mxGraphGenerator.getKnightTour
(mxAnalysisGraph aGraph, int xDim, int yDim, int startVertexValue) static Object[]
mxGraphStructure.getSinkVertices
(mxAnalysisGraph aGraph) static Object[]
mxGraphStructure.getSourceVertices
(mxAnalysisGraph aGraph) 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.static void
mxGraphStructure.makeTreeDirected
(mxAnalysisGraph aGraph, Object startVertex) Makes a tree graph directed from the source to the leavesvoid
mxGraphGenerator.oneSpanningTree
(mxAnalysisGraph aGraph, boolean forceConnected, boolean forceSimple) static int
mxGraphStructure.regularity
(mxAnalysisGraph aGraph)