MIT licensed by Kai Zhang
Maintained by Jean-Baptiste Mazon
This version can be pinned in stack with:haskell-igraph-0.8.5@sha256:448759324e5c5685e8c5d18df629ecc758ba87410c9fd12676668f7d11d4dd13,25474

Module documentation for 0.8.5

  • IGraph
    • IGraph.Algorithms
      • IGraph.Algorithms.Centrality
      • IGraph.Algorithms.Clique
      • IGraph.Algorithms.Community
      • IGraph.Algorithms.Generators
      • IGraph.Algorithms.Isomorphism
      • IGraph.Algorithms.Layout
      • IGraph.Algorithms.Motif
      • IGraph.Algorithms.Structure
    • IGraph.Internal
      • IGraph.Internal.Constants
      • IGraph.Internal.Initialization
    • IGraph.Mutable
    • IGraph.Random
    • IGraph.Types

Haskell bindings to igraph C library

Changes

Revision history for haskell-igraph

v0.8.5 – 2025-08-05

  • Ship igraph C sources v0.8.5
  • Add more functions

v0.8.0 – 2020-02-22

  • Ship igraph C sources v0.8.0

  • Add random number generator.

v0.7.1 – 2018-11-26

  • Add a few more functions.

v0.7.0 – 2018-05-23

  • Add more functions and tests.
  • Internal interface redesign.

v0.6.0 – 2018-05-10

  • Breaking change: Drop Graph type class. Change LGraph and MLGraph to Graph and MGraph. The new Graph and MGraph types are now dependently typed.

v0.5.0 – 2018-04-25

  • Fix memory leaks.
  • Interface change: mapNodes, mapEdges, filterNodes, filterEdges become nmap, emap, nfilter, efilter.

v0.4.0 – 2018-04-20

  • A new attribute interface written in C. The graph attributes are now directly serialized into bytestring using “cereal” (before we used the Show instance).