Author: simonetripodi
Date: Tue Jun 21 13:42:42 2011
New Revision: 1138004
URL: http://svn.apache.org/viewvc?rev=1138004&view=rev
Log:
typos in the method description
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java?rev=1138004&r1=1138003&r2=1138004&view=diff
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java
(original)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java
Tue Jun 21 13:42:42 2011
@@ -50,14 +50,15 @@ public final class Dijkstra
}
/**
- * Applies the classical Dijkstra algorithm to find the shortest path from
the source to the target, if exists.
+ * Applies the classical Dijkstra's algorithm to find the shortest path
from the source to the target, if exists.
*
* @param <V> the Graph vertices type.
* @param <WE> the Graph weighted edges type
* @param graph the Graph which shortest path from {@code source} to
{@code target} has to be found
* @param source the shortest path source Vertex
* @param target the shortest path target Vertex
- * @return a path wich describes the shortes path, if any, otherwise a
{@link PathNotFoundException} will be thrown
+ * @return a path which describes the shortest path, if any,
+ * otherwise a {@link PathNotFoundException} will be thrown
*/
public static <V extends Vertex, WE extends WeightedEdge<V>>
WeightedPath<V, WE> findShortestPath( WeightedGraph<V, WE> graph,
V source,
