fgl alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view fgl alternatives based on common mentions on social networks and blogs.
-
Agda
Agda is a dependently typed programming language / interactive theorem prover. -
vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. -
repa-convert
High performance, regular, shape polymorphic parallel arrays. -
repa-scalar
High performance, regular, shape polymorphic parallel arrays. -
parameterized-utils
A set of utilities for using indexed types including containers, equality, and comparison. -
ethereum-client-haskell
A Haskell version of an Ethereum client -
type-level-sets
Type-level sets for Haskell (with value-level counterparts and various operations) -
justified-containers
Standard containers, with keys that carry type-level proofs of their own presence. -
bytestring-trie
An efficient finite map from (byte)strings to values. -
nonempty-containers
Efficient non-empty variants of containers data types, with full API -
claferIG
Support for reasoning on Clafer models by instantiation and counter example generation. -
map-syntax
Syntax sugar and explicit semantics for statically defined maps -
igraph
Incomplete Haskell bindings to the igraph library (which is written in C) -
selections
Haskell Package for operating with selections over an underlying functor
Static code analysis for 29 languages.
Do you think we are missing an alternative of fgl or a related project?
README
The *F*unctional *G*raph *L*ibrary for Haskell
Originally by Martin Erwig, this library provides an inductive approach to dealing with graphs.
For more information, please read the documentation on Hackage.
The original website contains various papers that might help learning and understanding the approach taken by this library; however, the code might no longer match the actual implementation.
Arbitrary instances
If you wish to use fgl graphs with QuickCheck, have a look at the fgl-arbitrary package.
Original Credit attribution
From Martin Erwig's original README
I am grateful to many people who have helped me with bug reports, questions, comments, and implementations to improve the FGL. In particular, I would like to thank Martin Boehme, Luis Zeron, and Hal Daume for their contributions. Moreover, I would like to thank Abe Egnor and Isaac Jones at Aetion Technologies who refactored the modules into the new hierarchical name space and who have added two modules (see also the file CHANGES).