[ILouvain] basics function to render (still bug on karate).

src/Data/Graph/Clustering/ILouvain.hs

@@ -14,7 +14,7 @@ module Data.Graph.Clustering.ILouvain
   where
 
 import Data.Set (fromList)
-import Data.Maybe (catMaybes)
+import Data.Maybe (catMaybes, maybe)
 import Data.List (zip, cycle)
 import Protolude hiding (empty, (&))
 import Data.Graph.Inductive
@@ -38,10 +38,15 @@ convergence g = if m - m' > 0.1 then g else g'
 
 
 
-steps :: HyperGraph a a -> [Node] -> HyperGraph a a
-steps g [ ] = g
-steps g [_] = g
-steps g ns  = foldl' (\g1 n -> step' g g1 n $ neighbors g1 n) g ns
+iLouvain :: (Eq a) => HyperGraph a a -> [[Node]]
+iLouvain g = toNodes $ iLouvain' g $ path' g
+  where
+    toNodes g = map (\n -> hnodes g n) (nodes g)
+
+iLouvain' :: HyperGraph a a -> [Node] -> HyperGraph a a
+iLouvain' g [ ] = g
+iLouvain' g [_] = g
+iLouvain' g ns  = foldl' (\g1 n -> step' g g1 n $ neighbors g1 n) g ns
 
 step' :: HyperGraph a b
      -> HyperGraph a a
@@ -64,7 +69,6 @@ step g g' n1 n2 =
     s2 = imodularity g [n1,n2]
 
 ------------------------------------------------------------------------
-
 hnodes :: HyperGraph a b -> Node -> [Node]
 hnodes g n = case match n g of
   (Nothing, _) -> []
@@ -78,6 +82,10 @@ hdeg = undefined
 imodularity :: HyperGraph a b -> [Node] -> Double
 imodularity g ns = H.modularity g (fromList ns)
 
+------------------------------------------------------------------------
+
+toHyperGraph :: Gr () Double -> HyperGraph Double Double
+toHyperGraph g = nmap (\_ -> empty) g
 ------------------------------------------------------------------------
 -- Spoon Graph
 --    1
@@ -193,5 +201,9 @@ path g' = map sortNodes cs
       Just  n -> dfs [n] g  -- dfs for glustering, bfs for klustering
     cs = components g
     g  = undir g'
+
+path' :: (DynGraph gr, Eq b) => gr a b -> [Node]
+path' = maybe [] identity  . head . path
+
 ------------------------------------------------------------------------
 ------------------------------------------------------------------------