2012-10-29 20:17:12 +00:00
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
2014-04-01 11:30:48 +00:00
<!-- NewPage -->
< html lang = "en" >
< head >
2018-05-24 09:27:17 +00:00
<!-- Generated by javadoc (1.8.0_171) on Thu May 24 09:23:29 UTC 2018 -->
< title > mxTraversal (mxGraph 3.9.5 API Specification)< / title >
< meta name = "date" content = "2018-05-24" >
2014-04-01 11:30:48 +00:00
< link rel = "stylesheet" type = "text/css" href = "../../../stylesheet.css" title = "Style" >
2016-06-02 09:57:18 +00:00
< script type = "text/javascript" src = "../../../script.js" > < / script >
2014-04-01 11:30:48 +00:00
< / head >
< body >
< script type = "text/javascript" > < ! - -
2016-06-02 09:57:18 +00:00
try {
if (location.href.indexOf('is-external=true') == -1) {
2018-05-24 09:27:17 +00:00
parent.document.title="mxTraversal (mxGraph 3.9.5 API Specification)";
2016-06-02 09:57:18 +00:00
}
}
catch(err) {
2012-10-29 20:17:12 +00:00
}
2014-04-01 11:30:48 +00:00
//-->
2016-06-02 09:57:18 +00:00
var methods = {"i0":9,"i1":9,"i2":9,"i3":9,"i4":9,"i5":9};
var tabs = {65535:["t0","All Methods"],1:["t1","Static Methods"],8:["t4","Concrete Methods"]};
var altColor = "altColor";
var rowColor = "rowColor";
var tableTab = "tableTab";
var activeTableTab = "activeTableTab";
2014-04-01 11:30:48 +00:00
< / script >
< noscript >
< div > JavaScript is disabled on your browser.< / div >
< / noscript >
2012-10-29 20:17:12 +00:00
<!-- ========= START OF TOP NAVBAR ======= -->
2016-06-02 09:57:18 +00:00
< div class = "topNav" > < a name = "navbar.top" >
2014-04-01 11:30:48 +00:00
<!-- -->
2016-06-02 09:57:18 +00:00
< / a >
< div class = "skipNav" > < a href = "#skip.navbar.top" title = "Skip navigation links" > Skip navigation links< / a > < / div >
< a name = "navbar.top.firstrow" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "navList" title = "Navigation" >
< li > < a href = "../../../overview-summary.html" > Overview< / a > < / li >
< li > < a href = "package-summary.html" > Package< / a > < / li >
< li class = "navBarCell1Rev" > Class< / li >
< li > < a href = "class-use/mxTraversal.html" > Use< / a > < / li >
< li > < a href = "package-tree.html" > Tree< / a > < / li >
< li > < a href = "../../../deprecated-list.html" > Deprecated< / a > < / li >
< li > < a href = "../../../index-all.html" > Index< / a > < / li >
< li > < a href = "../../../help-doc.html" > Help< / a > < / li >
< / ul >
2018-05-24 09:27:17 +00:00
< div class = "aboutLanguage" > < p > < b > mxGraph 3.9.5< / b > < / p > < / div >
2014-04-01 11:30:48 +00:00
< / div >
< div class = "subNav" >
< ul class = "navList" >
2016-06-02 09:57:18 +00:00
< li > < a href = "../../../com/mxgraph/analysis/mxICostFunction.html" title = "interface in com.mxgraph.analysis" > < span class = "typeNameLink" > Prev Class< / span > < / a > < / li >
< li > < a href = "../../../com/mxgraph/analysis/mxUnionFind.html" title = "class in com.mxgraph.analysis" > < span class = "typeNameLink" > Next Class< / span > < / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "navList" >
< li > < a href = "../../../index.html?com/mxgraph/analysis/mxTraversal.html" target = "_top" > Frames< / a > < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "mxTraversal.html" target = "_top" > No Frames< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "navList" id = "allclasses_navbar_top" >
2016-06-02 09:57:18 +00:00
< li > < a href = "../../../allclasses-noframe.html" > All Classes< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< div >
< script type = "text/javascript" > < ! - -
allClassesLink = document.getElementById("allclasses_navbar_top");
2012-10-29 20:17:12 +00:00
if(window==top) {
2014-04-01 11:30:48 +00:00
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
2012-10-29 20:17:12 +00:00
}
//-->
2014-04-01 11:30:48 +00:00
< / script >
< / div >
< div >
< ul class = "subNavList" >
< li > Summary: < / li >
< li > Nested | < / li >
< li > Field | < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "#constructor.summary" > Constr< / a > | < / li >
< li > < a href = "#method.summary" > Method< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "subNavList" >
< li > Detail: < / li >
< li > Field | < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "#constructor.detail" > Constr< / a > | < / li >
< li > < a href = "#method.detail" > Method< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< / div >
2016-06-02 09:57:18 +00:00
< a name = "skip.navbar.top" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a > < / div >
2012-10-29 20:17:12 +00:00
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
2014-04-01 11:30:48 +00:00
< div class = "header" >
< div class = "subTitle" > com.mxgraph.analysis< / div >
< h2 title = "Class mxTraversal" class = "title" > Class mxTraversal< / h2 >
< / div >
< div class = "contentContainer" >
< ul class = "inheritance" >
2017-11-24 16:16:54 +00:00
< li > java.lang.Object< / li >
2014-04-01 11:30:48 +00:00
< li >
< ul class = "inheritance" >
< li > com.mxgraph.analysis.mxTraversal< / li >
< / ul >
< / li >
< / ul >
< div class = "description" >
< ul class = "blockList" >
< li class = "blockList" >
< hr >
< br >
2016-06-02 09:57:18 +00:00
< pre > public class < span class = "typeNameLabel" > mxTraversal< / span >
2017-11-24 16:16:54 +00:00
extends java.lang.Object< / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements a collection of utility methods for traversing the
graph structure. This does not include tree traversal methods.< / div >
< / li >
< / ul >
< / div >
< div class = "summary" >
< ul class = "blockList" >
< li class = "blockList" >
2012-10-29 20:17:12 +00:00
<!-- ======== CONSTRUCTOR SUMMARY ======== -->
2014-04-01 11:30:48 +00:00
< ul class = "blockList" >
2016-06-02 09:57:18 +00:00
< li class = "blockList" > < a name = "constructor.summary" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< h3 > Constructor Summary< / h3 >
2016-06-02 09:57:18 +00:00
< table class = "memberSummary" border = "0" cellpadding = "3" cellspacing = "0" summary = "Constructor Summary table, listing constructors, and an explanation" >
2014-04-01 11:30:48 +00:00
< caption > < span > Constructors< / span > < span class = "tabEnd" > < / span > < / caption >
< tr >
< th class = "colOne" scope = "col" > Constructor and Description< / th >
< / tr >
< tr class = "altColor" >
2016-06-02 09:57:18 +00:00
< td class = "colOne" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#mxTraversal--" > mxTraversal< / a > < / span > ()< / code > < / td >
2014-04-01 11:30:48 +00:00
< / tr >
< / table >
< / li >
< / ul >
2012-10-29 20:17:12 +00:00
<!-- ========== METHOD SUMMARY =========== -->
2014-04-01 11:30:48 +00:00
< ul class = "blockList" >
2016-06-02 09:57:18 +00:00
< li class = "blockList" > < a name = "method.summary" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< h3 > Method Summary< / h3 >
2016-06-02 09:57:18 +00:00
< table class = "memberSummary" border = "0" cellpadding = "3" cellspacing = "0" summary = "Method Summary table, listing methods, and an explanation" >
< caption > < span id = "t0" class = "activeTableTab" > < span > All Methods< / span > < span class = "tabEnd" > < / span > < / span > < span id = "t1" class = "tableTab" > < span > < a href = "javascript:show(1);" > Static Methods< / a > < / span > < span class = "tabEnd" > < / span > < / span > < span id = "t4" class = "tableTab" > < span > < a href = "javascript:show(8);" > Concrete Methods< / a > < / span > < span class = "tabEnd" > < / span > < / span > < / caption >
2014-04-01 11:30:48 +00:00
< tr >
< th class = "colFirst" scope = "col" > Modifier and Type< / th >
< th class = "colLast" scope = "col" > Method and Description< / th >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i0" class = "altColor" >
2017-11-24 16:16:54 +00:00
< td class = "colFirst" > < code > static java.util.List< java.util.Map< java.lang.Object,java.lang.Object> > < / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#bellmanFord-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-" > bellmanFord< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex)< / code >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements the Bellman-Ford shortest path from startVertex to all vertices.< / div >
< / td >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i1" class = "rowColor" >
2014-04-01 11:30:48 +00:00
< td class = "colFirst" > < code > static void< / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#bfs-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" > bfs< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
2014-04-01 11:30:48 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)< / code >
< div class = "block" > Implements a recursive breadth first search starting from the specified
cell.< / div >
< / td >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i2" class = "altColor" >
2014-04-01 11:30:48 +00:00
< td class = "colFirst" > < code > static void< / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#dfs-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" > dfs< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
2014-04-01 11:30:48 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)< / code >
< div class = "block" > Implements a recursive depth first search starting from the specified
cell.< / div >
< / td >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i3" class = "rowColor" >
2014-04-01 11:30:48 +00:00
< td class = "colFirst" > < code > static void< / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#dijkstra-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" > dijkstra< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
java.lang.Object endVertex,
2014-04-01 11:30:48 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)< / code >
< div class = "block" > Implements the Dijkstra's shortest path from startVertex to endVertex.< / div >
< / td >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i4" class = "altColor" >
2017-11-24 16:16:54 +00:00
< td class = "colFirst" > < code > static java.util.ArrayList< java.lang.Object[][]> < / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#floydRoyWarshall-com.mxgraph.analysis.mxAnalysisGraph-" > floydRoyWarshall< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph)< / code >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements the Floyd-Roy-Warshall (aka WFI) shortest path algorithm between all vertices.< / div >
< / td >
< / tr >
2016-06-02 09:57:18 +00:00
< tr id = "i5" class = "rowColor" >
2017-11-24 16:16:54 +00:00
< td class = "colFirst" > < code > static java.lang.Object[]< / code > < / td >
2016-06-02 09:57:18 +00:00
< td class = "colLast" > < code > < span class = "memberNameLink" > < a href = "../../../com/mxgraph/analysis/mxTraversal.html#getWFIPath-com.mxgraph.analysis.mxAnalysisGraph-java.util.ArrayList-java.lang.Object-java.lang.Object-" > getWFIPath< / a > < / span > (< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.util.ArrayList< java.lang.Object[][]> FWIresult,
java.lang.Object startVertex,
java.lang.Object targetVertex)< / code >
2014-04-01 11:30:48 +00:00
< div class = "block" > This method helps the user to get the desired data from the result of the Floyd-Roy-Warshall algorithm.< / div >
< / td >
< / tr >
< / table >
< ul class = "blockList" >
2016-06-02 09:57:18 +00:00
< li class = "blockList" > < a name = "methods.inherited.from.class.java.lang.Object" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
2017-11-24 16:16:54 +00:00
< h3 > Methods inherited from class java.lang.Object< / h3 >
< code > clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait< / code > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< / li >
< / ul >
< / li >
< / ul >
< / div >
< div class = "details" >
< ul class = "blockList" >
< li class = "blockList" >
2012-10-29 20:17:12 +00:00
<!-- ========= CONSTRUCTOR DETAIL ======== -->
2014-04-01 11:30:48 +00:00
< ul class = "blockList" >
2016-06-02 09:57:18 +00:00
< li class = "blockList" > < a name = "constructor.detail" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< h3 > Constructor Detail< / h3 >
2016-06-02 09:57:18 +00:00
< a name = "mxTraversal--" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockListLast" >
< li class = "blockList" >
< h4 > mxTraversal< / h4 >
< pre > public mxTraversal()< / pre >
< / li >
< / ul >
< / li >
< / ul >
2012-10-29 20:17:12 +00:00
<!-- ============ METHOD DETAIL ========== -->
2014-04-01 11:30:48 +00:00
< ul class = "blockList" >
2016-06-02 09:57:18 +00:00
< li class = "blockList" > < a name = "method.detail" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< h3 > Method Detail< / h3 >
2016-06-02 09:57:18 +00:00
< a name = "dfs-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > dfs< / h4 >
< pre > public static void dfs(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
2016-06-02 09:57:18 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)< / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements a recursive depth first search starting from the specified
2012-10-29 20:17:12 +00:00
cell. Process on the cell is performing by the visitor class passed in.
The visitor has access to the current cell and the edge traversed to
find this cell. Every cell is processed once only.
< pre >
2012-12-18 13:09:38 +00:00
mxTraversal.bfs(analysisGraph, startVertex, new mxICellVisitor()
2012-10-29 20:17:12 +00:00
{
public boolean visit(Object vertex, Object edge)
{
// perform your processing on each cell here
return false;
}
});
2014-04-01 11:30:48 +00:00
< / pre > < / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > Parameters:< / span > < / dt >
< dd > < code > aGraph< / code > - the graph< / dd >
< dd > < code > startVertex< / code > - < / dd >
< dd > < code > visitor< / code > - < / dd >
< / dl >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
2016-06-02 09:57:18 +00:00
< a name = "bfs-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > bfs< / h4 >
< pre > public static void bfs(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
2016-06-02 09:57:18 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)< / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements a recursive breadth first search starting from the specified
2012-12-18 13:09:38 +00:00
cell. Process on the cell is performing by the visitor class passed in.
The visitor has access to the current cell and the edge traversed to
find this cell. Every cell is processed once only.
< pre >
mxTraversal.bfs(analysisGraph, startVertex, new mxICellVisitor()
{
public boolean visit(Object vertex, Object edge)
{
// perform your processing on each cell here
return false;
}
});
2014-04-01 11:30:48 +00:00
< / pre > < / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > Parameters:< / span > < / dt >
< dd > < code > aGraph< / code > - the graph< / dd >
< dd > < code > startVertex< / code > - < / dd >
< dd > < code > visitor< / code > - < / dd >
< / dl >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
2016-06-02 09:57:18 +00:00
< a name = "dijkstra-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-java.lang.Object-com.mxgraph.view.mxGraph.mxICellVisitor-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > dijkstra< / h4 >
< pre > public static void dijkstra(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
2017-11-24 16:16:54 +00:00
java.lang.Object startVertex,
java.lang.Object endVertex,
2016-06-02 09:57:18 +00:00
< a href = "../../../com/mxgraph/view/mxGraph.mxICellVisitor.html" title = "interface in com.mxgraph.view" > mxGraph.mxICellVisitor< / a > visitor)
2014-04-01 11:30:48 +00:00
throws < a href = "../../../com/mxgraph/analysis/StructuralException.html" title = "class in com.mxgraph.analysis" > StructuralException< / a > < / pre >
< div class = "block" > Implements the Dijkstra's shortest path from startVertex to endVertex.
2012-12-18 13:09:38 +00:00
Process on the cell is performing by the visitor class passed in.
The visitor has access to the current cell and the edge traversed to
find this cell. Every cell is processed once only.
< pre >
mxTraversal.dijkstra(analysisGraph, startVertex, endVertex, new mxICellVisitor()
{
public boolean visit(Object vertex, Object edge)
{
// perform your processing on each cell here
return false;
}
});
2014-04-01 11:30:48 +00:00
< / pre > < / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > Parameters:< / span > < / dt >
< dd > < code > aGraph< / code > - < / dd >
< dd > < code > startVertex< / code > - < / dd >
< dd > < code > endVertex< / code > - < / dd >
< dd > < code > visitor< / code > - < / dd >
< dt > < span class = "throwsLabel" > Throws:< / span > < / dt >
< dd > < code > < a href = "../../../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 >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
2016-06-02 09:57:18 +00:00
< a name = "bellmanFord-com.mxgraph.analysis.mxAnalysisGraph-java.lang.Object-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > bellmanFord< / h4 >
2017-11-24 16:16:54 +00:00
< pre > public static java.util.List< java.util.Map< java.lang.Object,java.lang.Object> > bellmanFord(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
java.lang.Object startVertex)
throws < a href = "../../../com/mxgraph/analysis/StructuralException.html" title = "class in com.mxgraph.analysis" > StructuralException< / a > < / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements the Bellman-Ford shortest path from startVertex to all vertices.< / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > Parameters:< / span > < / dt >
< dd > < code > aGraph< / code > - < / dd >
< dd > < code > startVertex< / code > - < / dd >
< dt > < span class = "returnLabel" > 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 > < span class = "throwsLabel" > Throws:< / span > < / dt >
< dd > < code > < a href = "../../../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 >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
2016-06-02 09:57:18 +00:00
< a name = "floydRoyWarshall-com.mxgraph.analysis.mxAnalysisGraph-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > floydRoyWarshall< / h4 >
2017-11-24 16:16:54 +00:00
< pre > public static java.util.ArrayList< java.lang.Object[][]> floydRoyWarshall(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph)
throws < a href = "../../../com/mxgraph/analysis/StructuralException.html" title = "class in com.mxgraph.analysis" > StructuralException< / a > < / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > Implements the Floyd-Roy-Warshall (aka WFI) shortest path algorithm between all vertices.< / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > Parameters:< / span > < / dt >
< dd > < code > aGraph< / code > - < / dd >
< dt > < span class = "returnLabel" > 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 > < span class = "throwsLabel" > Throws:< / span > < / dt >
< dd > < code > < a href = "../../../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 >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
2016-06-02 09:57:18 +00:00
< a name = "getWFIPath-com.mxgraph.analysis.mxAnalysisGraph-java.util.ArrayList-java.lang.Object-java.lang.Object-" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "blockListLast" >
< li class = "blockList" >
< h4 > getWFIPath< / h4 >
2017-11-24 16:16:54 +00:00
< pre > public static java.lang.Object[] getWFIPath(< a href = "../../../com/mxgraph/analysis/mxAnalysisGraph.html" title = "class in com.mxgraph.analysis" > mxAnalysisGraph< / a > aGraph,
java.util.ArrayList< java.lang.Object[][]> FWIresult,
java.lang.Object startVertex,
java.lang.Object targetVertex)
throws < a href = "../../../com/mxgraph/analysis/StructuralException.html" title = "class in com.mxgraph.analysis" > StructuralException< / a > < / pre >
2014-04-01 11:30:48 +00:00
< div class = "block" > This method helps the user to get the desired data from the result of the Floyd-Roy-Warshall algorithm.< / div >
2016-06-02 09:57:18 +00:00
< dl >
< dt > < span class = "paramLabel" > 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 > < span class = "returnLabel" > Returns:< / span > < / dt >
< dd > returns the shortest path from < b > startVertex< / b > to < b > endVertex< / b > < / dd >
< dt > < span class = "throwsLabel" > Throws:< / span > < / dt >
< dd > < code > < a href = "../../../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 >
2014-04-01 11:30:48 +00:00
< / li >
< / ul >
< / li >
< / ul >
< / li >
< / ul >
< / div >
< / div >
2012-10-29 20:17:12 +00:00
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
2016-06-02 09:57:18 +00:00
< div class = "bottomNav" > < a name = "navbar.bottom" >
2014-04-01 11:30:48 +00:00
<!-- -->
2016-06-02 09:57:18 +00:00
< / a >
< div class = "skipNav" > < a href = "#skip.navbar.bottom" title = "Skip navigation links" > Skip navigation links< / a > < / div >
< a name = "navbar.bottom.firstrow" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a >
< ul class = "navList" title = "Navigation" >
< li > < a href = "../../../overview-summary.html" > Overview< / a > < / li >
< li > < a href = "package-summary.html" > Package< / a > < / li >
< li class = "navBarCell1Rev" > Class< / li >
< li > < a href = "class-use/mxTraversal.html" > Use< / a > < / li >
< li > < a href = "package-tree.html" > Tree< / a > < / li >
< li > < a href = "../../../deprecated-list.html" > Deprecated< / a > < / li >
< li > < a href = "../../../index-all.html" > Index< / a > < / li >
< li > < a href = "../../../help-doc.html" > Help< / a > < / li >
< / ul >
2018-05-24 09:27:17 +00:00
< div class = "aboutLanguage" > < p > < b > mxGraph 3.9.5< / b > < / p > < / div >
2014-04-01 11:30:48 +00:00
< / div >
< div class = "subNav" >
< ul class = "navList" >
2016-06-02 09:57:18 +00:00
< li > < a href = "../../../com/mxgraph/analysis/mxICostFunction.html" title = "interface in com.mxgraph.analysis" > < span class = "typeNameLink" > Prev Class< / span > < / a > < / li >
< li > < a href = "../../../com/mxgraph/analysis/mxUnionFind.html" title = "class in com.mxgraph.analysis" > < span class = "typeNameLink" > Next Class< / span > < / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "navList" >
< li > < a href = "../../../index.html?com/mxgraph/analysis/mxTraversal.html" target = "_top" > Frames< / a > < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "mxTraversal.html" target = "_top" > No Frames< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "navList" id = "allclasses_navbar_bottom" >
2016-06-02 09:57:18 +00:00
< li > < a href = "../../../allclasses-noframe.html" > All Classes< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< div >
< script type = "text/javascript" > < ! - -
allClassesLink = document.getElementById("allclasses_navbar_bottom");
2012-10-29 20:17:12 +00:00
if(window==top) {
2014-04-01 11:30:48 +00:00
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
2012-10-29 20:17:12 +00:00
}
//-->
2014-04-01 11:30:48 +00:00
< / script >
< / div >
< div >
< ul class = "subNavList" >
< li > Summary: < / li >
< li > Nested | < / li >
< li > Field | < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "#constructor.summary" > Constr< / a > | < / li >
< li > < a href = "#method.summary" > Method< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< ul class = "subNavList" >
< li > Detail: < / li >
< li > Field | < / li >
2016-06-02 09:57:18 +00:00
< li > < a href = "#constructor.detail" > Constr< / a > | < / li >
< li > < a href = "#method.detail" > Method< / a > < / li >
2014-04-01 11:30:48 +00:00
< / ul >
< / div >
2016-06-02 09:57:18 +00:00
< a name = "skip.navbar.bottom" >
2014-04-01 11:30:48 +00:00
<!-- -->
< / a > < / div >
2012-10-29 20:17:12 +00:00
<!-- ======== END OF BOTTOM NAVBAR ======= -->
2017-06-27 11:43:19 +00:00
< p class = "legalCopy" > < small > < font size = 1 > Copyright (c) 2010-2017 < a href = "http://www.jgraph.com/"
target="_blank">Gaudenz Alder, JGraph Ltd< / a > . All rights reserved.< / font > < / small > < / p >
2014-04-01 11:30:48 +00:00
< / body >
< / html >
