[Org] Gargantext.Core.Methods

src/Gargantext/Core/Viz/Graph/Proxemy.hs → src/Gargantext/Core/Methods/Graph/BAC/Proxemy.hs

@@ -14,7 +14,7 @@ Références:
 -}
 
 
-module Gargantext.Core.Viz.Graph.Proxemy
+module Gargantext.Core.Methods.Graph.BAC.Proxemy
   where
 
 --import Debug.SimpleReflect

src/Gargantext/Core/Viz/Graph/Louvain.hs → src/Gargantext/Core/Methods/Graph/Louvain.hs

@@ -10,7 +10,7 @@ Portability : POSIX
 -}
 
 
-module Gargantext.Core.Viz.Graph.Louvain
+module Gargantext.Core.Methods.Graph.Louvain
   where
 
 import Gargantext.Prelude

src/Gargantext/Core/Viz/Graph/Bridgeness.hs

@@ -26,12 +26,11 @@ import qualified Data.Map as DM
 import Data.Maybe (catMaybes)
 import Data.List (concat, sortOn)
 import Data.Graph.Clustering.Louvain.Utils (LouvainNode(..))
-import Gargantext.Core.Viz.Graph.Louvain (LouvainNodeId, CommunityId, nodeId2comId)
+import Gargantext.Core.Methods.Graph.Louvain (LouvainNodeId, CommunityId, nodeId2comId)
 
 
 type Bridgeness = Double
 
-
 bridgeness :: Bridgeness
            -> [LouvainNode]
            -> Map (LouvainNodeId, LouvainNodeId) Double

src/Gargantext/Core/Viz/Graph/MaxClique.hs

@@ -6,8 +6,9 @@ Maintainer  : team@gargantext.org
 Stability   : experimental
 Portability : POSIX
 
-- First written by Bruno Gaume in Python        (see below for details)
-- Then  written by Alexandre Delanoë in Haskell (see below for details)
+- Result of Pyremiel 2019
+  - First written by Bruno Gaume in Python        (see below for details)
+  - Then  written by Alexandre Delanoë in Haskell (see below for details)
 
 # By Bruno Gaume:
 def fast_maximal_cliques(g):

src/Gargantext/Core/Viz/Graph/Tools.hs

@@ -27,7 +27,7 @@ import Gargantext.Core.Viz.Graph.Bridgeness (bridgeness)
 import Gargantext.Core.Viz.Graph.Distances (Distance(..), measure)
 import Gargantext.Core.Viz.Graph.Index (createIndices, toIndex, map2mat, mat2map, Index)
 import Gargantext.Core.Viz.Graph.IGraph (mkGraphUfromEdges)
-import Gargantext.Core.Viz.Graph.Proxemy (confluence)
+import Gargantext.Core.Methods.Graph.BAC.Proxemy (confluence)
 import GHC.Float (sin, cos)
 import qualified IGraph as Igraph
 import IGraph.Random -- (Gen(..))