Du kannst nicht mehr als 25 Themen auswählen
Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.
427 Zeilen
23 KiB
HTML
427 Zeilen
23 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
|
|
<!-- NewPage -->
|
|
<html lang="en">
|
|
<head>
|
|
<!-- Generated by javadoc (version 1.7.0_79) on Sun Apr 03 00:28:30 PDT 2016 -->
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>BellmanFordShortestPath (JGraphT : a free Java graph library)</title>
|
|
<meta name="date" content="2016-04-03">
|
|
<link rel="stylesheet" type="text/css" href="../../../stylesheet.css" title="Style">
|
|
</head>
|
|
<body>
|
|
<script type="text/javascript"><!--
|
|
if (location.href.indexOf('is-external=true') == -1) {
|
|
parent.document.title="BellmanFordShortestPath (JGraphT : a free Java graph library)";
|
|
}
|
|
//-->
|
|
</script>
|
|
<noscript>
|
|
<div>JavaScript is disabled on your browser.</div>
|
|
</noscript>
|
|
<!-- ========= START OF TOP NAVBAR ======= -->
|
|
<div class="topNav"><a name="navbar_top">
|
|
<!-- -->
|
|
</a><a href="#skip-navbar_top" title="Skip navigation links"></a><a name="navbar_top_firstrow">
|
|
<!-- -->
|
|
</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/BellmanFordShortestPath.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>
|
|
</div>
|
|
<div class="subNav">
|
|
<ul class="navList">
|
|
<li><a href="../../../org/jgrapht/alg/AStarShortestPath.html" title="class in org.jgrapht.alg"><span class="strong">Prev Class</span></a></li>
|
|
<li><a href="../../../org/jgrapht/alg/BiconnectivityInspector.html" title="class in org.jgrapht.alg"><span class="strong">Next Class</span></a></li>
|
|
</ul>
|
|
<ul class="navList">
|
|
<li><a href="../../../index.html?org/jgrapht/alg/BellmanFordShortestPath.html" target="_top">Frames</a></li>
|
|
<li><a href="BellmanFordShortestPath.html" target="_top">No Frames</a></li>
|
|
</ul>
|
|
<ul class="navList" id="allclasses_navbar_top">
|
|
<li><a href="../../../allclasses-noframe.html">All Classes</a></li>
|
|
</ul>
|
|
<div>
|
|
<script type="text/javascript"><!--
|
|
allClassesLink = document.getElementById("allclasses_navbar_top");
|
|
if(window==top) {
|
|
allClassesLink.style.display = "block";
|
|
}
|
|
else {
|
|
allClassesLink.style.display = "none";
|
|
}
|
|
//-->
|
|
</script>
|
|
</div>
|
|
<div>
|
|
<ul class="subNavList">
|
|
<li>Summary: </li>
|
|
<li>Nested | </li>
|
|
<li><a href="#field_summary">Field</a> | </li>
|
|
<li><a href="#constructor_summary">Constr</a> | </li>
|
|
<li><a href="#method_summary">Method</a></li>
|
|
</ul>
|
|
<ul class="subNavList">
|
|
<li>Detail: </li>
|
|
<li><a href="#field_detail">Field</a> | </li>
|
|
<li><a href="#constructor_detail">Constr</a> | </li>
|
|
<li><a href="#method_detail">Method</a></li>
|
|
</ul>
|
|
</div>
|
|
<a name="skip-navbar_top">
|
|
<!-- -->
|
|
</a></div>
|
|
<!-- ========= END OF TOP NAVBAR ========= -->
|
|
<!-- ======== START OF CLASS DATA ======== -->
|
|
<div class="header">
|
|
<div class="subTitle">org.jgrapht.alg</div>
|
|
<h2 title="Class BellmanFordShortestPath" class="title">Class BellmanFordShortestPath<V,E></h2>
|
|
</div>
|
|
<div class="contentContainer">
|
|
<ul class="inheritance">
|
|
<li><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">java.lang.Object</a></li>
|
|
<li>
|
|
<ul class="inheritance">
|
|
<li>org.jgrapht.alg.BellmanFordShortestPath<V,E></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<div class="description">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<hr>
|
|
<br>
|
|
<pre>public class <span class="strong">BellmanFordShortestPath<V,E></span>
|
|
extends <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</a></pre>
|
|
<div class="block"><a href="http://www.nist.gov/dads/HTML/bellmanford.html">Bellman-Ford
|
|
algorithm</a>: weights could be negative, paths could be constrained by a
|
|
maximum number of edges.</div>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div class="summary">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<!-- =========== FIELD SUMMARY =========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="field_summary">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Field Summary</h3>
|
|
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Field Summary table, listing fields, and an explanation">
|
|
<caption><span>Fields</span><span class="tabEnd"> </span></caption>
|
|
<tr>
|
|
<th class="colFirst" scope="col">Modifier and Type</th>
|
|
<th class="colLast" scope="col">Field and Description</th>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>protected <a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#graph">graph</a></strong></code>
|
|
<div class="block">Graph on which shortest paths are searched.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>protected <a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#startVertex">startVertex</a></strong></code>
|
|
<div class="block">Start vertex.</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
</li>
|
|
</ul>
|
|
<!-- ======== CONSTRUCTOR SUMMARY ======== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="constructor_summary">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Constructor Summary</h3>
|
|
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Constructor Summary table, listing constructors, and an explanation">
|
|
<caption><span>Constructors</span><span class="tabEnd"> </span></caption>
|
|
<tr>
|
|
<th class="colOne" scope="col">Constructor and Description</th>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colOne"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#BellmanFordShortestPath(org.jgrapht.Graph,%20V)">BellmanFordShortestPath</a></strong>(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex)</code>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colOne"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#BellmanFordShortestPath(org.jgrapht.Graph,%20V,%20int)">BellmanFordShortestPath</a></strong>(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex,
|
|
int nMaxHops)</code>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colOne"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#BellmanFordShortestPath(org.jgrapht.Graph,%20V,%20int,%20double)">BellmanFordShortestPath</a></strong>(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex,
|
|
int nMaxHops,
|
|
double epsilon)</code>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
</li>
|
|
</ul>
|
|
<!-- ========== METHOD SUMMARY =========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="method_summary">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Method Summary</h3>
|
|
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
|
|
<caption><span>Methods</span><span class="tabEnd"> </span></caption>
|
|
<tr>
|
|
<th class="colFirst" scope="col">Modifier and Type</th>
|
|
<th class="colLast" scope="col">Method and Description</th>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code>static <V,E> <a href="http://docs.oracle.com/javase/7/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><E></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#findPathBetween(org.jgrapht.Graph,%20V,%20V)">findPathBetween</a></strong>(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><V,E> graph,
|
|
V startVertex,
|
|
V endVertex)</code>
|
|
<div class="block">Convenience method to find the shortest path via a single static method
|
|
call.</div>
|
|
</td>
|
|
</tr>
|
|
<tr class="rowColor">
|
|
<td class="colFirst"><code>double</code></td>
|
|
<td class="colLast"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#getCost(V)">getCost</a></strong>(<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> endVertex)</code> </td>
|
|
</tr>
|
|
<tr class="altColor">
|
|
<td class="colFirst"><code><a href="http://docs.oracle.com/javase/7/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>></code></td>
|
|
<td class="colLast"><code><strong><a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html#getPathEdgeList(V)">getPathEdgeList</a></strong>(<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> endVertex)</code> </td>
|
|
</tr>
|
|
</table>
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="methods_inherited_from_class_java.lang.Object">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Methods inherited from class java.lang.<a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</a></h3>
|
|
<code><a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#clone()" title="class or interface in java.lang">clone</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#equals(java.lang.Object)" title="class or interface in java.lang">equals</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#finalize()" title="class or interface in java.lang">finalize</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#getClass()" title="class or interface in java.lang">getClass</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#hashCode()" title="class or interface in java.lang">hashCode</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#notify()" title="class or interface in java.lang">notify</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#notifyAll()" title="class or interface in java.lang">notifyAll</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#toString()" title="class or interface in java.lang">toString</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait()" title="class or interface in java.lang">wait</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait(long)" title="class or interface in java.lang">wait</a>, <a href="http://docs.oracle.com/javase/7/docs/api/java/lang/Object.html?is-external=true#wait(long,%20int)" title="class or interface in java.lang">wait</a></code></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
<div class="details">
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<!-- ============ FIELD DETAIL =========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="field_detail">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Field Detail</h3>
|
|
<a name="graph">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>graph</h4>
|
|
<pre>protected <a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph</pre>
|
|
<div class="block">Graph on which shortest paths are searched.</div>
|
|
</li>
|
|
</ul>
|
|
<a name="startVertex">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockListLast">
|
|
<li class="blockList">
|
|
<h4>startVertex</h4>
|
|
<pre>protected <a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex</pre>
|
|
<div class="block">Start vertex.</div>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<!-- ========= CONSTRUCTOR DETAIL ======== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="constructor_detail">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Constructor Detail</h3>
|
|
<a name="BellmanFordShortestPath(org.jgrapht.Graph,java.lang.Object)">
|
|
<!-- -->
|
|
</a><a name="BellmanFordShortestPath(org.jgrapht.Graph, V)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>BellmanFordShortestPath</h4>
|
|
<pre>public BellmanFordShortestPath(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex)</pre>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>graph</code> - </dd><dd><code>startVertex</code> - </dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="BellmanFordShortestPath(org.jgrapht.Graph,java.lang.Object,int)">
|
|
<!-- -->
|
|
</a><a name="BellmanFordShortestPath(org.jgrapht.Graph, V, int)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>BellmanFordShortestPath</h4>
|
|
<pre>public BellmanFordShortestPath(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex,
|
|
int nMaxHops)</pre>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>graph</code> - </dd><dd><code>startVertex</code> - </dd><dd><code>nMaxHops</code> - maximum number of edges of the calculated paths.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="BellmanFordShortestPath(org.jgrapht.Graph,java.lang.Object,int,double)">
|
|
<!-- -->
|
|
</a><a name="BellmanFordShortestPath(org.jgrapht.Graph, V, int, double)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockListLast">
|
|
<li class="blockList">
|
|
<h4>BellmanFordShortestPath</h4>
|
|
<pre>public BellmanFordShortestPath(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a>,<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> graph,
|
|
<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> startVertex,
|
|
int nMaxHops,
|
|
double epsilon)</pre>
|
|
<div class="block">Creates an object to calculate shortest paths between the start vertex
|
|
and others vertices using the Bellman-Ford algorithm.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>graph</code> - </dd><dd><code>startVertex</code> - </dd><dd><code>nMaxHops</code> - maximum number of edges of the calculated paths.</dd><dd><code>epsilon</code> - tolerance factor.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<!-- ============ METHOD DETAIL ========== -->
|
|
<ul class="blockList">
|
|
<li class="blockList"><a name="method_detail">
|
|
<!-- -->
|
|
</a>
|
|
<h3>Method Detail</h3>
|
|
<a name="getCost(java.lang.Object)">
|
|
<!-- -->
|
|
</a><a name="getCost(V)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>getCost</h4>
|
|
<pre>public double getCost(<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> endVertex)</pre>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>endVertex</code> - end vertex.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>the cost of the shortest path between the start vertex and the
|
|
end vertex.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="getPathEdgeList(java.lang.Object)">
|
|
<!-- -->
|
|
</a><a name="getPathEdgeList(V)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockList">
|
|
<li class="blockList">
|
|
<h4>getPathEdgeList</h4>
|
|
<pre>public <a href="http://docs.oracle.com/javase/7/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">E</a>> getPathEdgeList(<a href="../../../org/jgrapht/alg/BellmanFordShortestPath.html" title="type parameter in BellmanFordShortestPath">V</a> endVertex)</pre>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>endVertex</code> - end vertex.</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>list of <code>Edge</code>, or null if no path exists between the
|
|
start vertex and the end vertex.</dd></dl>
|
|
</li>
|
|
</ul>
|
|
<a name="findPathBetween(org.jgrapht.Graph,java.lang.Object,java.lang.Object)">
|
|
<!-- -->
|
|
</a><a name="findPathBetween(org.jgrapht.Graph, V, V)">
|
|
<!-- -->
|
|
</a>
|
|
<ul class="blockListLast">
|
|
<li class="blockList">
|
|
<h4>findPathBetween</h4>
|
|
<pre>public static <V,E> <a href="http://docs.oracle.com/javase/7/docs/api/java/util/List.html?is-external=true" title="class or interface in java.util">List</a><E> findPathBetween(<a href="../../../org/jgrapht/Graph.html" title="interface in org.jgrapht">Graph</a><V,E> graph,
|
|
V startVertex,
|
|
V endVertex)</pre>
|
|
<div class="block">Convenience method to find the shortest path via a single static method
|
|
call. If you need a more advanced search (e.g. limited by hops, or
|
|
computation of the path length), use the constructor instead.</div>
|
|
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>graph</code> - the graph to be searched</dd><dd><code>startVertex</code> - the vertex at which the path should start</dd><dd><code>endVertex</code> - the vertex at which the path should end</dd>
|
|
<dt><span class="strong">Returns:</span></dt><dd>List of Edges, or null if no path exists</dd></dl>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
<!-- ========= END OF CLASS DATA ========= -->
|
|
<!-- ======= START OF BOTTOM NAVBAR ====== -->
|
|
<div class="bottomNav"><a name="navbar_bottom">
|
|
<!-- -->
|
|
</a><a href="#skip-navbar_bottom" title="Skip navigation links"></a><a name="navbar_bottom_firstrow">
|
|
<!-- -->
|
|
</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/BellmanFordShortestPath.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>
|
|
</div>
|
|
<div class="subNav">
|
|
<ul class="navList">
|
|
<li><a href="../../../org/jgrapht/alg/AStarShortestPath.html" title="class in org.jgrapht.alg"><span class="strong">Prev Class</span></a></li>
|
|
<li><a href="../../../org/jgrapht/alg/BiconnectivityInspector.html" title="class in org.jgrapht.alg"><span class="strong">Next Class</span></a></li>
|
|
</ul>
|
|
<ul class="navList">
|
|
<li><a href="../../../index.html?org/jgrapht/alg/BellmanFordShortestPath.html" target="_top">Frames</a></li>
|
|
<li><a href="BellmanFordShortestPath.html" target="_top">No Frames</a></li>
|
|
</ul>
|
|
<ul class="navList" id="allclasses_navbar_bottom">
|
|
<li><a href="../../../allclasses-noframe.html">All Classes</a></li>
|
|
</ul>
|
|
<div>
|
|
<script type="text/javascript"><!--
|
|
allClassesLink = document.getElementById("allclasses_navbar_bottom");
|
|
if(window==top) {
|
|
allClassesLink.style.display = "block";
|
|
}
|
|
else {
|
|
allClassesLink.style.display = "none";
|
|
}
|
|
//-->
|
|
</script>
|
|
</div>
|
|
<div>
|
|
<ul class="subNavList">
|
|
<li>Summary: </li>
|
|
<li>Nested | </li>
|
|
<li><a href="#field_summary">Field</a> | </li>
|
|
<li><a href="#constructor_summary">Constr</a> | </li>
|
|
<li><a href="#method_summary">Method</a></li>
|
|
</ul>
|
|
<ul class="subNavList">
|
|
<li>Detail: </li>
|
|
<li><a href="#field_detail">Field</a> | </li>
|
|
<li><a href="#constructor_detail">Constr</a> | </li>
|
|
<li><a href="#method_detail">Method</a></li>
|
|
</ul>
|
|
</div>
|
|
<a name="skip-navbar_bottom">
|
|
<!-- -->
|
|
</a></div>
|
|
<!-- ======== END OF BOTTOM NAVBAR ======= -->
|
|
<p class="legalCopy"><small>Copyright © 2016. All rights reserved.</small></p>
|
|
</body>
|
|
</html>
|