Rebalance lines

robertlayton · Sep 5, 2013 · aeaded6 · aeaded6
1 parent de04e21
commit aeaded6
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/doc/modules/clustering.rst b/doc/modules/clustering.rst
@@ -578,7 +578,7 @@ Minimum Spanning Tree Clustering
 The :class:`MSTCluster` algorithm forms a minimum spanning tree over the data,
 and then cuts any edges that have a weight higher than some predefined
 threshold. This separates the data into connected components, each representing
-a separate cluster.
+a separate git cocluster.
 
 In graph theory, a minimum spanning tree is a set of connections between nodes
 that link all nodes together with the minimum sum of weights. In the