Author: simonetripodi
Date: Tue Jun 21 19:44:51 2011
New Revision: 1138146
URL: http://svn.apache.org/viewvc?rev=1138146&view=rev
Log:
typos
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/FloydWarshall.java
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java?rev=1138146&r1=1138145&r2=1138146&view=diff
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java
(original)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/AStar.java
Tue Jun 21 19:44:51 2011
@@ -46,7 +46,7 @@ public final class AStar
* @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,
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java?rev=1138146&r1=1138145&r2=1138146&view=diff
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
(original)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
Tue Jun 21 19:44:51 2011
@@ -47,7 +47,7 @@ public final class BellmannFord
* @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>, G extends
WeightedGraph<V, WE> & DirectedGraph<V, WE>> WeightedPath<V, WE>
findShortestPath( G graph,
V source,
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/FloydWarshall.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/FloydWarshall.java?rev=1138146&r1=1138145&r2=1138146&view=diff
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/FloydWarshall.java
(original)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/FloydWarshall.java
Tue Jun 21 19:44:51 2011
@@ -46,7 +46,7 @@ public final class FloydWarshall
* @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,
