import Data.Maybe (catMaybes)
import Data.Ord (Down(..))
import Gargantext.Prelude
-import qualified Data.Map as DM
import Graph.Types (ClusterNode(..))
+import qualified Data.Map as DM
+
+
----------------------------------------------------------------------
type Partitions a = Map (Int, Int) Double -> IO [a]
. toList
-- | TODO : sortOn Confluence
-
filterComs :: (Ord n1, Eq n2)
=> p
-> Map (n2, n2) [(a3, n1)]