You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by si...@apache.org on 2012/01/26 12:21:26 UTC
svn commit: r1236142 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
Author: simonetripodi
Date: Thu Jan 26 11:21:25 2012
New Revision: 1236142
URL: http://svn.apache.org/viewvc?rev=1236142&view=rev
Log:
replaced unmappable character for encoding UTF-8
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/BellmannFord.java
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=1236142&r1=1236141&r2=1236142&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 Thu Jan 26 11:21:25 2012
@@ -28,7 +28,7 @@ import org.apache.commons.graph.weight.O
import org.apache.commons.graph.weight.primitive.DoubleWeight;
/**
- * Contains the BellmanÐFord's shortest path algorithm implementation.
+ * Contains the Bellman-Ford's shortest path algorithm implementation.
*/
public final class BellmannFord
{
@@ -42,7 +42,7 @@ public final class BellmannFord
}
/**
- * Applies the classical BellmanÐFord's algorithm to find the shortest path from the source to the target, if exists.
+ * Applies the classical Bellman-Ford'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
@@ -122,7 +122,7 @@ public final class BellmannFord
}
/**
- * Applies the classical BellmanÐFord's algorithm to an edge weighted graph with weights of type Double
+ * Applies the classical Bellman-Ford's algorithm to an edge weighted graph with weights of type Double
* to find the shortest path from the source to the target, if exists.
*
* @param <V> the Graph vertices type