Copyright | (c) CNRS 2017-Present |
---|---|

License | AGPL + CECILL v3 |

Maintainer | team@gargantext.org |

Stability | experimental |

Portability | POSIX |

Safe Haskell | Safe-Inferred |

Language | Haskell2010 |

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

## Synopsis

- type Graph_Undirected = Graph 'U () ()
- type Graph_Directed = Graph 'D () ()
- type Node = Node
- type Graph = Graph
- neighbors :: Graph d v e -> Node -> [Node]
- edges :: Graph d v e -> [Edge]
- nodes :: Graph d v e -> [Node]
- maximalCliques :: Graph d v e -> [[Int]]
- type Seed = Int
- spinglass :: Seed -> Map (Int, Int) Double -> IO [ClusterNode]
- spinglass' :: Seed -> Map (Int, Int) Double -> IO [Set Int]
- partitions_spinglass' :: (Serialize v, Serialize e) => Seed -> Graph 'U v e -> IO [[Int]]
- toClusterNode :: [[Int]] -> [ClusterNode]
- mkGraph :: (SingI d, Ord v, Serialize v, Serialize e) => [v] -> [LEdge e] -> Graph d v e
- mkGraphUfromEdges :: [(Int, Int)] -> Graph_Undirected

# Documentation

type Graph_Undirected = Graph 'U () () #

Main Types

type Graph_Directed = Graph 'D () () #

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

Partitions

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

Tools to analyze graphs

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

mkGraphUfromEdges :: [(Int, Int)] -> Graph_Undirected #