Some doc for a paper

src/Data/Graph/Clustering/HLouvain.hs

@@ -7,6 +7,15 @@ Maintainer  : alexandre.delanoe+louvain@iscpif.fr
 Stability   : experimental
 Portability : POSIX
 
+Clustering is not precise enought to work with (kmeans clustering is not
+the same methodology than Louvain clustering fo rinstance).
+
+Here is a new semantic to change this situation.
+glustering vs klustering
+
+glustering: agglomerate according to glue rules (bottom up)
+klustering: split in k parts according to klue rules (top down)
+
 -}
 
 {-# LANGUAGE ConstrainedClassMethods #-}
@@ -133,7 +142,6 @@ inDendo g d1@(Dendogram _ _) d2@(Dendogram _ _) = Dendogram n' (hasScore g n')
     n' | hasScore g [d1, d2] > ss = [d1,d2]
        | otherwise = [ds]
 
-
 -------------------------------------------------------------------
 nodesD :: Dendogram -> Set Node
 nodesD (Gram n) = Set.singleton n
@@ -233,5 +241,3 @@ unionFind = ST.runUnionFind $ do
   pure n'
 -}
 
-
-