svn commit: r1136665 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/Dijkstra.java

[simonetripodi]

Author: simonetripodi
Date: Thu Jun 16 20:45:39 2011
New Revision: 1136665

URL: http://svn.apache.org/viewvc?rev=1136665&view=rev
Log:
added source node distance initialization to 0
fixed node distance calculus

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=1136665&r1=1136664&r2=1136665&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
 Thu Jun 16 20:45:39 2011
@@ -62,6 +62,7 @@ public final class Dijkstra
                                                                                
                        V target )
     {
         final ShortestDistances<V> shortestDistances = new 
ShortestDistances<V>();
+        shortestDistances.put( source, 0D );
 
         final PriorityQueue<V> unsettledNodes =
             new PriorityQueue<V>( graph.getVertices().size(), 
shortestDistances );