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/07/05 20:32:06 UTC

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

Author: simonetripodi
Date: Tue Jul  5 18:32:06 2011
New Revision: 1143162

URL: http://svn.apache.org/viewvc?rev=1143162&view=rev
Log:
added missing source parameter in javadoc

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=1143162&r1=1143161&r2=1143162&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 Tue Jul  5 18:32:06 2011
@@ -57,7 +57,8 @@ public final class Prim
      * @param <WE> the Graph weighted edges type.
      * @param <G> the weighted-undirected input graph type
      * @param graph the Graph for which minimum spanning tree has to be calculated.
-     * @return  the minimum spanning tree of the input Graph.
+     * @param source the Prim's Vertex source
+     * @return the minimum spanning tree of the input Graph.
      */
     public static <V extends Vertex, WE extends WeightedEdge, G extends WeightedGraph<V, WE> & UndirectedGraph<V, WE>> SpanningTree<V, WE> minimumSpanningTree( G graph,
                                                                                                                                                                 V source )