<li><ahref="../../../com/mxgraph/analysis/mxICostFunction.html"title="interface in com.mxgraph.analysis"><spanclass="strong">Prev Class</span></a></li>
<li><ahref="../../../com/mxgraph/analysis/mxUnionFind.html"title="class in com.mxgraph.analysis"><spanclass="strong">Next Class</span></a></li>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxTraversal.html#bellmanFord(com.mxgraph.analysis.mxAnalysisGraph, java.lang.Object)">bellmanFord</a></strong>(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<divclass="block">Implements the Bellman-Ford shortest path from startVertex to all vertices.</div>
</td>
</tr>
<trclass="rowColor">
<tdclass="colFirst"><code>static void</code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxTraversal.html#bfs(com.mxgraph.analysis.mxAnalysisGraph, java.lang.Object, com.mxgraph.view.mxGraph.mxICellVisitor)">bfs</a></strong>(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<ahref="../../../com/mxgraph/view/mxGraph.mxICellVisitor.html"title="interface in com.mxgraph.view">mxGraph.mxICellVisitor</a> visitor)</code>
<divclass="block">Implements a recursive breadth first search starting from the specified
cell.</div>
</td>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code>static void</code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxTraversal.html#dfs(com.mxgraph.analysis.mxAnalysisGraph, java.lang.Object, com.mxgraph.view.mxGraph.mxICellVisitor)">dfs</a></strong>(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxTraversal.html#floydRoyWarshall(com.mxgraph.analysis.mxAnalysisGraph)">floydRoyWarshall</a></strong>(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph)</code>
<divclass="block">Implements the Floyd-Roy-Warshall (aka WFI) shortest path algorithm between all vertices.</div>
<pre>public static void dfs(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<pre>public static void bfs(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<pre>public static void dijkstra(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<dd><code><ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></code> - - The current Dijkstra algorithm only works for connected graphs</dd></dl>
<pre>public static java.util.List<java.util.Map<java.lang.Object,java.lang.Object>> bellmanFord(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
java.lang.Object startVertex)
throws <ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></pre>
<dt><spanclass="strong">Returns:</span></dt><dd>a List where List(0) is the distance map and List(1) is the parent map. See the example in GraphConfigDialog.java</dd>
<dt><spanclass="strong">Throws:</span></dt>
<dd><code><ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></code> - - The Bellman-Ford algorithm only works for graphs without negative cycles</dd></dl>
<pre>public static java.util.ArrayList<java.lang.Object[][]> floydRoyWarshall(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph)
throws <ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></pre>
<dt><spanclass="strong">Returns:</span></dt><dd>an ArrayList where ArrayList(0) is the distance map and List(1) is the path map. See the example in GraphConfigDialog.java</dd>
<dt><spanclass="strong">Throws:</span></dt>
<dd><code><ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></code> - - The Floyd-Roy-Warshall algorithm only works for graphs without negative cycles</dd></dl>
<pre>public static java.lang.Object[] getWFIPath(<ahref="../../../com/mxgraph/analysis/mxAnalysisGraph.html"title="class in com.mxgraph.analysis">mxAnalysisGraph</a> aGraph,
<divclass="block">This method helps the user to get the desired data from the result of the Floyd-Roy-Warshall algorithm.</div>
<dl><dt><spanclass="strong">Parameters:</span></dt><dd><code>aGraph</code> - </dd><dd><code>FWIresult</code> - - the result of the Floyd-Roy-Warhall algorithm</dd><dd><code>startVertex</code> - </dd><dd><code>targetVertex</code> - </dd>
<dt><spanclass="strong">Returns:</span></dt><dd>returns the shortest path from <b>startVertex</b> to <b>endVertex</b></dd>
<dt><spanclass="strong">Throws:</span></dt>
<dd><code><ahref="../../../com/mxgraph/analysis/StructuralException.html"title="class in com.mxgraph.analysis">StructuralException</a></code> - - The Floyd-Roy-Warshall algorithm only works for graphs without negative cycles</dd></dl>
<li><ahref="../../../com/mxgraph/analysis/mxICostFunction.html"title="interface in com.mxgraph.analysis"><spanclass="strong">Prev Class</span></a></li>
<li><ahref="../../../com/mxgraph/analysis/mxUnionFind.html"title="class in com.mxgraph.analysis"><spanclass="strong">Next Class</span></a></li>