svn commit: r1142418 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/spanning/Prim.java

[simonetripodi]

Author: simonetripodi
Date: Sun Jul  3 11:36:40 2011
New Revision: 1142418

URL: http://svn.apache.org/viewvc?rev=1142418&view=rev
Log:
Prim's algorithm requires a source Vertex to be executed
Prim's algorithm returned Graph is a WeightedGraph

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

Modified: 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/spanning/Prim.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/spanning/Prim.java?rev=1142418&r1=1142417&r2=1142418&view=diff
==============================================================================
--- 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/spanning/Prim.java
 (original)
+++ 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/spanning/Prim.java
 Sun Jul  3 11:36:40 2011
@@ -19,7 +19,6 @@ package org.apache.commons.graph.spannin
  * under the License.
  */
 
-import org.apache.commons.graph.Graph;
 import org.apache.commons.graph.Vertex;
 import org.apache.commons.graph.WeightedEdge;
 import org.apache.commons.graph.WeightedGraph;
@@ -38,7 +37,8 @@ public final class Prim
      * @param graph the Graph for which minimum spanning tree (or forest) has 
to be calculated.
      * @return  the minimum spanning tree (or forest) of the input Graph.
      */
-    public static <V extends Vertex, WE extends WeightedEdge> Graph<V, WE> 
minimumSpanningTree( WeightedGraph<V, WE> graph )
+    public static <V extends Vertex, WE extends WeightedEdge> WeightedGraph<V, 
WE> minimumSpanningTree( WeightedGraph<V, WE> graph,
+                                                                               
                         V source )
     {
         return null;
     }