{-| Module : Gargantext.Core.Viz.Graph.Tools Description : Tools to build Graph Copyright : (c) CNRS, 2017-Present License : AGPL + CECILL v3 Maintainer : team@gargantext.org Stability : experimental Portability : POSIX -} module Gargantext.Core.Viz.Graph.Tools where import Debug.Trace (trace) import Data.Graph.Clustering.Louvain.Utils (LouvainNode(..)) -- import Data.Graph.Clustering.Louvain (hLouvain, {-iLouvainMap-}) import Data.Graph.Clustering.Louvain.CplusPlus (cLouvain) import Data.Map (Map) import qualified Data.Set as Set import Data.Text (Text) import Gargantext.Prelude import Gargantext.Core.Statistics import Gargantext.Core.Viz.Graph 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 GHC.Float (sin, cos) import qualified IGraph as Igraph import qualified IGraph.Algorithms.Layout as Layout import qualified Data.Vector.Storable as Vec import qualified Data.Map as Map import qualified Data.List as List type Threshold = Double cooc2graph' :: Ord t => Distance -> Double -> Map (t, t) Int -> Map (Index, Index) Double cooc2graph' distance threshold myCooc = distanceMap where (ti, _) = createIndices myCooc myCooc' = toIndex ti myCooc matCooc = map2mat 0 (Map.size ti) $ Map.filter (> 0) myCooc' distanceMat = measure distance matCooc distanceMap = Map.filter (> threshold) $ mat2map distanceMat cooc2graph :: Distance -> Threshold -> (Map (Text, Text) Int) -> IO Graph cooc2graph distance threshold myCooc = do printDebug "cooc2graph" distance let (ti, _) = createIndices myCooc myCooc' = toIndex ti myCooc matCooc = map2mat 0 (Map.size ti) $ Map.filterWithKey (\(a,b) _ -> a /= b) $ Map.filter (> 1) myCooc' distanceMat = measure distance matCooc distanceMap = Map.filter (> threshold) $ mat2map distanceMat nodesApprox :: Int nodesApprox = n' where (as, bs) = List.unzip $ Map.keys distanceMap n' = Set.size $ Set.fromList $ as <> bs ClustersParams rivers level = clustersParams nodesApprox partitions <- if (Map.size distanceMap > 0) -- then iLouvainMap 100 10 distanceMap -- then hLouvain distanceMap then cLouvain level distanceMap else panic "Text.Flow: DistanceMap is empty" let -- bridgeness' = distanceMap bridgeness' = trace ("Rivers: " <> show rivers) $ bridgeness rivers partitions distanceMap confluence' = confluence (Map.keys bridgeness') 3 True False pure $ data2graph (Map.toList ti) myCooc' bridgeness' confluence' partitions data ClustersParams = ClustersParams { bridgness :: Double , louvain :: Text } deriving (Show) clustersParams :: Int -> ClustersParams clustersParams x = ClustersParams (fromIntegral x) "0.00000001" -- y {- where y | x < 100 = "0.000001" | x < 350 = "0.000001" | x < 500 = "0.000001" | x < 1000 = "0.000001" | otherwise = "1" -} ---------------------------------------------------------- -- | From data to Graph data2graph :: [(Text, Int)] -> Map (Int, Int) Int -> Map (Int, Int) Double -> Map (Int, Int) Double -> [LouvainNode] -> Graph data2graph labels coocs bridge conf partitions = Graph nodes edges Nothing where community_id_by_node_id = Map.fromList [ (n, c) | LouvainNode n c <- partitions ] nodes = map (setCoord ForceAtlas labels bridge) [ (n, Node { node_size = maybe 0 identity (Map.lookup (n,n) coocs) , node_type = Terms -- or Unknown , node_id = cs (show n) , node_label = l , node_x_coord = 0 , node_y_coord = 0 , node_attributes = Attributes { clust_default = maybe 0 identity (Map.lookup n community_id_by_node_id) } } ) | (l, n) <- labels , Set.member n $ Set.fromList $ List.concat $ map (\((s,t),d) -> if d > 0 && s /=t then [s,t] else []) $ Map.toList bridge ] edges = [ Edge { edge_source = cs (show s) , edge_target = cs (show t) , edge_weight = d , edge_confluence = maybe 0 identity $ Map.lookup (s,t) conf -- , edge_confluence = maybe (panic "E: data2graph edges") identity $ Map.lookup (s,t) conf , edge_id = cs (show i) } | (i, ((s,t), d)) <- zip ([0..]::[Integer]) (Map.toList bridge), s /= t, d > 0 ] ------------------------------------------------------------------------ data Layout = KamadaKawai | ACP | ForceAtlas setCoord' :: (Int -> (Double, Double)) -> (Int, Node) -> Node setCoord' f (i,n) = n { node_x_coord = x, node_y_coord = y } where (x,y) = f i -- | ACP setCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> (Int, Node) -> Node setCoord l labels m (n,node) = node { node_x_coord = x , node_y_coord = y } where (x,y) = getCoord l labels m n getCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> Int -> (Double, Double) getCoord KamadaKawai _ _m _n = undefined -- layout m n getCoord ForceAtlas _ _ n = (sin d, cos d) where d = fromIntegral n getCoord ACP labels m n = to2d $ maybe (panic "Graph.Tools no coordinate") identity $ Map.lookup n $ pcaReduceTo (Dimension 2) $ mapArray labels m where to2d :: Vec.Vector Double -> (Double, Double) to2d v = (x',y') where ds = take 2 $ Vec.toList v x' = head' "to2d" ds y' = last' "to2d" ds mapArray :: Ord a => [(a, Int)] -> Map (Int, Int) Double -> Map Int (Vec.Vector Double) mapArray items m' = Map.fromList [ toVec n' ns m' | n' <- ns ] where ns = map snd items toVec :: Int -> [Int] -> Map (Int,Int) Double -> (Int, Vec.Vector Double) toVec n' ns' m' = (n', Vec.fromList $ map (\n'' -> maybe 0 identity $ Map.lookup (n',n'') m') ns') ------------------------------------------------------------------------ -- | KamadaKawai Layout -- TODO TEST: check labels, nodeId and coordinates layout :: Map (Int, Int) Double -> Int -> IO (Double, Double) layout m n = maybe (panic "") identity <$> Map.lookup n <$> coord where coord :: IO (Map Int (Double,Double)) coord = Map.fromList <$> List.zip (Igraph.nodes g) <$> (Layout.getLayout g p) --p = Layout.defaultLGL p = Layout.defaultKamadaKawai g = mkGraphUfromEdges $ map fst $ List.filter (\e -> snd e > 0) $ Map.toList m