Commit 14dbf55a authored by Alexandre Delanoë's avatar Alexandre Delanoë

[FEAT] connnecting new clustering algorithm

parent 16dfd469
...@@ -30,6 +30,7 @@ import Gargantext.Core.Viz.Graph.Index (createIndices, toIndex, map2mat, mat2map ...@@ -30,6 +30,7 @@ import Gargantext.Core.Viz.Graph.Index (createIndices, toIndex, map2mat, mat2map
import Gargantext.Core.Viz.Graph.Tools.IGraph (mkGraphUfromEdges, spinglass) import Gargantext.Core.Viz.Graph.Tools.IGraph (mkGraphUfromEdges, spinglass)
import Gargantext.Prelude import Gargantext.Prelude
import Graph.Types (ClusterNode) import Graph.Types (ClusterNode)
import qualified Graph.BAC.ProxemyOptim as BAC
import IGraph.Random -- (Gen(..)) import IGraph.Random -- (Gen(..))
import qualified Data.HashMap.Strict as HashMap import qualified Data.HashMap.Strict as HashMap
import qualified Data.List as List import qualified Data.List as List
...@@ -41,12 +42,10 @@ import qualified IGraph.Algorithms.Layout as Layout ...@@ -41,12 +42,10 @@ import qualified IGraph.Algorithms.Layout as Layout
------------------------------------------------------------- -------------------------------------------------------------
defaultClustering :: Map (Int, Int) Double -> IO [ClusterNode] defaultClustering :: Map (Int, Int) Double -> IO [ClusterNode]
defaultClustering = spinglass 1 defaultClustering x = pure $ BAC.defaultClustering x
------------------------------------------------------------- -------------------------------------------------------------
type Threshold = Double type Threshold = Double
cooc2graph' :: Ord t => Distance cooc2graph' :: Ord t => Distance
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment