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 2011/06/21 17:18:04 UTC

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

Author: simonetripodi
Date: Tue Jun 21 15:18:04 2011
New Revision: 1138044

URL: http://svn.apache.org/viewvc?rev=1138044&view=rev
Log:
minor format

Modified:
    commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java

Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java?rev=1138044&r1=1138043&r2=1138044&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/shortestpath/PredecessorsList.java Tue Jun 21 15:18:04 2011
@@ -63,8 +63,7 @@ final class PredecessorsList<V extends V
      */
     public WeightedPath<V, WE> buildPath( V source, V target, Double cost )
     {
-        InMemoryWeightedPath<V, WE> path =
-            new InMemoryWeightedPath<V, WE>( source, target, cost );
+        InMemoryWeightedPath<V, WE> path = new InMemoryWeightedPath<V, WE>( source, target, cost );
 
         V vertex = target;
         while ( !source.equals( vertex ) )