Author: simonetripodi
Date: Tue Jul 5 18:27:14 2011
New Revision: 1143159
URL: http://svn.apache.org/viewvc?rev=1143159&view=rev
Log:
fixed javadoc, Prim's doesn't produce a spanning tree (if nodes are not
reachable from the source, they are cut out)
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=1143159&r1=1143158&r2=1143159&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:27:14 2011
@@ -51,12 +51,13 @@ public final class Prim
}
/**
- * Calculates the minimum spanning tree (or forest) of the input Graph,
given a known source.
+ * Calculates the minimum spanning tree of the input Graph, given a known
Vertex source.
*
* @param <V> the Graph vertices type.
* @param <WE> the Graph weighted edges type.
- * @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.
+ * @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.
*/
public static <V extends Vertex, WE extends WeightedEdge, G extends
WeightedGraph<V, WE> & UndirectedGraph<V, WE>> SpanningTree<V, WE>
minimumSpanningTree( G graph,
V source )
