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.IGraph

Description

  • Gábor Csárdi, Tamás Nepusz: The igraph software package for complex network research. InterJournal Complex Systems, 1695, 2006.
Synopsis

Documentation

type Graph_Undirected = Graph 'U () () Source #

Main Types

type Graph_Directed = Graph 'D () () Source #

type Node = Node Source #

neighbors :: Graph d v e -> Node -> [Node] Source #

Main Graph management Functions

edges :: Graph d v e -> [Edge] Source #

nodes :: Graph d v e -> [Node] Source #

maximalCliques :: Graph d v e -> [[Int]] Source #

Partitions

type Seed = Int Source #

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

partitions_spinglass' :: (Serialize v, Serialize e) => Seed -> Graph 'U v e -> IO [[Int]] Source #

Tools to analyze graphs

toClusterNode :: [[Int]] -> [ClusterNode] Source #

mkGraph :: (SingI d, Ord v, Serialize v, Serialize e) => [v] -> [LEdge e] -> Graph d v e Source #