gargantext-0.0.4.9.5: Search, map, share
Copyright(c) CNRS 2017-Present
LicenseAGPL + CECILL v3
Maintainerteam@gargantext.org
Stabilityexperimental
PortabilityPOSIX
Safe HaskellNone
LanguageHaskell2010

Gargantext.Core.Viz.Graph.Tools

Description

 
Synopsis

Documentation

defaultClustering :: Map (Int, Int) Double -> IO [ClusterNode] Source #

cooc2graphWith' :: ToComId a => Partitions a -> Distance -> Threshold -> HashMap (NgramsTerm, NgramsTerm) Int -> IO Graph Source #

type Occurrences = Map (Int, Int) Int Source #

From data to Graph

data2graph :: ToComId a => [(Text, Int)] -> Occurrences -> Map (Int, Int) Double -> Map (Int, Int) Double -> [a] -> Graph Source #

data Layout Source #

Constructors

KamadaKawai 
ACP 
ForceAtlas 

setCoord' :: (Int -> (Double, Double)) -> (Int, Node) -> Node Source #

setCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> (Int, Node) -> Node Source #

ACP

getCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> Int -> (Double, Double) Source #

layout :: Map (Int, Int) Double -> Int -> Gen -> (Double, Double) Source #

KamadaKawai Layout TODO TEST: check labels, nodeId and coordinates