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 17:58:08 UTC
svn commit: r1236289 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java

Author: simonetripodi
Date: Thu Jan 26 16:58:08 2012
New Revision: 1236289

URL: http://svn.apache.org/viewvc?rev=1236289&view=rev
Log:
fixed generics type inference - thanks to Emanuele Lombardi who provided the fix

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

Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java?rev=1236289&r1=1236288&r2=1236289&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java Thu Jan 26 16:58:08 2012
@@ -75,7 +75,7 @@ public final class CommonsGraph<V extend
      * @param graph the input edge-weighted graph
      * @return
      */
-    public static <V extends Vertex, W, WE extends WeightedEdge<W>, G extends DirectedGraph<V, WE>> FromHeadBuilder<V, W, WE, G> findMaxFlow( G graph )
+    public static <V extends Vertex, WE extends WeightedEdge<W>, W, G extends DirectedGraph<V, WE>> FromHeadBuilder<V, W, WE, G> findMaxFlow( G graph )
     {
         graph = checkNotNull( graph, "Max flow can not be calculated on null graph" );
         return new DefaultFromHeadBuilder<V, W, WE, G>( graph );
@@ -86,7 +86,7 @@ public final class CommonsGraph<V extend
      * @param graph
      * @return
      */
-    public static <V extends Vertex, W, WE extends WeightedEdge<W>, G extends Graph<V, WE>> SpanningTreeSourceSelector<V, W, WE, G> minimumSpanningTree( G graph )
+    public static <V extends Vertex, WE extends WeightedEdge<W>, W, G extends Graph<V, WE>> SpanningTreeSourceSelector<V, W, WE, G> minimumSpanningTree( G graph )
     {
         graph = checkNotNull( graph, "Minimum spanning tree can not be calculated on null graph" );
         return new DefaultSpanningTreeSourceSelector<V, W, WE, G>( graph );
@@ -101,7 +101,7 @@ public final class CommonsGraph<V extend
      * @param <G>
      * @param graph
      */
-    public static <V extends Vertex, W, WE extends WeightedEdge<W>, G extends Graph<V, WE>> PathSourceSelector<V, W, WE, G> findShortesPath( G graph )
+    public static <V extends Vertex, WE extends WeightedEdge<W>, W, G extends Graph<V, WE>> PathSourceSelector<V, W, WE, G> findShortesPath( G graph )
     {
         graph = checkNotNull( graph, "Minimum spanning tree can not be calculated on null graph" );
         return null;