Copyright | (c) CNRS 2017-Present |
---|---|
License | AGPL + CECILL v3 |
Maintainer | team@gargantext.org |
Stability | experimental |
Portability | POSIX |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Synopsis
- data PartitionMethod
- data BridgenessMethod
- defaultClustering :: Map (Int, Int) Double -> IO [ClusterNode]
- type Threshold = Double
- cooc2graph' :: Ord t => Similarity -> Double -> Map (t, t) Int -> Map (Index, Index) Double
- cooc2graphWith :: PartitionMethod -> BridgenessMethod -> MultiPartite -> Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> IO Graph
- cooc2graphWith' :: Partitions -> BridgenessMethod -> MultiPartite -> Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> IO Graph
- type Reverse = Bool
- doSimilarityMap :: Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> (Map (Int, Int) Double, Map (Index, Index) Int, Map NgramsTerm Index)
- type Occurrences = Int
- nodeTypeWith :: MultiPartite -> NgramsTerm -> NgramsType
- data2graph :: MultiPartite -> Map NgramsTerm Int -> Map (Int, Int) Occurrences -> Map (Int, Int) Double -> Map (Int, Int) Double -> [ClusterNode] -> Graph
- data Layout
- = KamadaKawai
- | ACP
- | ForceAtlas
- setCoord' :: (Int -> (Double, Double)) -> (Int, Node) -> Node
- setCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> (Int, Node) -> Node
- getCoord :: Ord a => Layout -> [(a, Int)] -> Map (Int, Int) Double -> Int -> (Double, Double)
- layout :: Map (Int, Int) Double -> Int -> Gen -> (Double, Double)
- cooc2graph'' :: Ord t => Similarity -> Double -> Map (t, t) Int -> Map (Index, Index) Double
- filterByNeighbours :: Double -> Map (Index, Index) Double -> Map (Index, Index) Double
Documentation
data PartitionMethod #
Instances
data BridgenessMethod #
Instances
defaultClustering :: Map (Int, Int) Double -> IO [ClusterNode] #
cooc2graphWith :: PartitionMethod -> BridgenessMethod -> MultiPartite -> Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> IO Graph #
cooc2graphWith' :: Partitions -> BridgenessMethod -> MultiPartite -> Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> IO Graph #
doSimilarityMap :: Similarity -> Threshold -> Strength -> HashMap (NgramsTerm, NgramsTerm) Int -> (Map (Int, Int) Double, Map (Index, Index) Int, Map NgramsTerm Index) #
type Occurrences = Int #
From data to Graph
nodeTypeWith :: MultiPartite -> NgramsTerm -> NgramsType #
data2graph :: MultiPartite -> Map NgramsTerm Int -> Map (Int, Int) Occurrences -> Map (Int, Int) Double -> Map (Int, Int) Double -> [ClusterNode] -> Graph #