fgl alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view fgl alternatives based on common mentions on social networks and blogs.

miso

10.0 7.1 fgl VS miso

:ramen: A tasty Haskell front-end framework
hevm

10.0 9.2 fgl VS hevm

Dapp, Seth, Hevm, and more

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org

Agda

10.0 9.6 fgl VS Agda

Agda is a dependently typed programming language / interactive theorem prover.
containers

9.8 6.1 fgl VS containers

Assorted concrete container types
singletons

9.7 5.6 fgl VS singletons

Fake dependent types in Haskell using singletons
vinyl

9.7 5.5 fgl VS vinyl

Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
repa-scalar

9.5 3.3 fgl VS repa-scalar

High performance, regular, shape polymorphic parallel arrays.
repa-eval

9.5 3.3 fgl VS repa-eval

High performance, regular, shape polymorphic parallel arrays.
repa-array

9.5 3.3 fgl VS repa-array

High performance, regular, shape polymorphic parallel arrays.
repa-convert

9.5 3.3 fgl VS repa-convert

High performance, regular, shape polymorphic parallel arrays.
cubical

9.4 0.0 fgl VS cubical

Implementation of Univalence in Cubical Sets
parameterized-utils

9.2 8.1 fgl VS parameterized-utils

A set of utilities for using indexed types including containers, equality, and comparison.
psqueues

9.1 2.5 fgl VS psqueues

Priority Search Queues in three different flavors for Haskell
hoq

9.0 0.0 fgl VS hoq

A language based on homotopy type theory with an interval
ethereum-client-haskell

9.0 0.0 fgl VS ethereum-client-haskell

A Haskell version of an Ethereum client
adjunctions

9.0 2.7 fgl VS adjunctions

Simple adjunctions
distributive

8.9 1.3 fgl VS distributive

Dual Traversable
bookkeeper

8.8 0.0 fgl VS bookkeeper

Anonymous records and overloaded labels
type-level-sets

8.8 5.7 fgl VS type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations)
justified-containers

8.7 0.0 fgl VS justified-containers

Standard containers, with keys that carry type-level proofs of their own presence.
clafer

8.6 0.0 fgl VS clafer

Clafer is a lightweight modeling language
EdisonAPI

8.5 0.0 fgl VS EdisonAPI

Edison: A Library of Efficient Data Structures
slist

8.4 0.0 fgl VS slist

♾️ Sized list
bytestring-trie

8.2 9.0 fgl VS bytestring-trie

An efficient finite map from (byte)strings to values.
ixset-typed

8.2 0.4 fgl VS ixset-typed

More strongly typed variant of the ixset Haskell package
void

8.1 0.0 fgl VS void

Provides Data.Void, which is in base since ghc 7.8 or so
knit

7.9 0.0 fgl VS knit

Ties the knot on data structures that reference each other by unique keys
heaps

7.9 0.0 fgl VS heaps

Asymptotically optimal Brodal/Okasaki heaps
bitset

7.9 0.0 fgl VS bitset

A compact functional set data structure
hamtmap

7.9 0.0 fgl VS hamtmap

A purely functional and persistent hash map
haggle

7.9 1.9 fgl VS haggle

An efficient graph library for Haskell
multiset

7.8 0.0 fgl VS multiset

multiset haskell package
nonempty-containers

7.6 2.4 fgl VS nonempty-containers

Efficient non-empty variants of containers data types, with full API
graphite

7.6 0.0 fgl VS graphite

Haskell graphs and networks library
algebra-checkers

7.4 0.0 fgl VS algebra-checkers

checkers for algebra driven design
data-r-tree

7.4 0.0 fgl VS data-r-tree

Haskell implementatio of R-Trees
map-exts

7.4 0.0 fgl VS map-exts

Extensions to Data.Map
eliminators

7.3 3.0 fgl VS eliminators

Dependently typed elimination functions using singletons
helf

7.3 3.7 fgl VS helf

Haskell implementation of the Edinburgh Logical Framework
rawr

7.2 0.0 fgl VS rawr

Anonymous extensible records and variant types
claferIG

7.1 0.0 fgl VS claferIG

Support for reasoning on Clafer models by instantiation and counter example generation.
ixset

6.8 0.0 fgl VS ixset

A Set type which supports multiple indexes
representable-functors

6.7 0.0 fgl VS representable-functors

representable functors
map-syntax

6.7 0.0 fgl VS map-syntax

Syntax sugar and explicit semantics for statically defined maps
mtl-c

6.6 0.0 fgl VS mtl-c

Monad transformers in CPS
hw-fingertree-strict

6.6 0.0 fgl VS hw-fingertree-strict

Generic strict finger-tree structure
igraph

6.4 0.0 fgl VS igraph

Incomplete Haskell bindings to the igraph library (which is written in C)
selections

6.4 0.0 fgl VS selections

Haskell Package for operating with selections over an underlying functor
ethereum-analyzer

6.4 0.0 fgl VS ethereum-analyzer

An Ethereum contract analyzer.
supermonad

6.3 0.0 fgl VS supermonad

A plugin for GHC to support super monads.

Do you think we are missing an alternative of fgl or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

The Functional Graph Library 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).