fgl vs heaps

fgl

A Functional Graph Library for Haskell (by haskell)

Data structures

Source Code

hackage.haskell.org

Suggest alternative

Edit details

heaps

Asymptotically optimal Brodal/Okasaki heaps (by ekmett)

Data structures

Source Code

hackage.haskell.org

Suggest alternative

Edit details

Our great sponsors

WorkOS - The modern identity platform for B2B SaaS

InfluxDB - Power Real-Time Data Analytics at Scale

SaaSHub - Software Alternatives and Reviews

Our great sponsors

fgl		heaps
	Project
5	Mentions	1
183	Stars	29
1.1%	Growth	-
6.6	Activity	0.0
10 days ago	Latest Commit	over 1 year ago
Haskell	Language	Haskell
BSD 3-clause "New" or "Revised" License	License	BSD 3-clause "New" or "Revised" License

The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

fgl

Posts with mentions or reviews of fgl. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-10-03.

N-ary Tree data structure with efficient parent access?
1 project | /r/haskellquestions | 18 Dec 2022

Your names are good, I reckon it is Martin Erwig's fgl stuff and Andrey Mokhov's algebraic-graphs that you have in mind.
Library for Tree-like data structure
2 projects | /r/haskell | 3 Oct 2022

I am about to start a new project in Haskell, model checking with (new) tree-like data structures. I think it is best to start building on a library such that i can already have elegant base functions, yet i am wondering what library is currently the standard? I read about fgl ( https://hackage.haskell.org/package/fgl ), yet it is a very old library.
Want to start a new project and I'm wondering if Haskell is the right tool for it
1 project | /r/haskell | 27 Jul 2022

Couple of approaches to graphs that are state-free: functional graphs and algebraic graphs
-🎄- 2021 Day 12 Solutions -🎄-
145 projects | /r/adventofcode | 11 Dec 2021

Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-🎄- 2021 Day 9 Solutions -🎄-
185 projects | /r/adventofcode | 8 Dec 2021

For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.

heaps

Posts with mentions or reviews of heaps. We have used some of these posts to build our list of alternatives and similar projects.

What's "One Cool Thing" about OCaml? I.e. some piece of code or language concept which is more elegant or powerful in ocaml than in most or all other mainstream languages, but that could be explained to a room of unfamiliar cs majors in under five minutes?
1 project | /r/ocaml | 25 Apr 2022

You can implement all this in Haskell (and Kmett has), but the double-layer functor presentation is beautiful in its expression of recursion and memoization through the composition of first-class modules. Yes, you could do this with typeclasses in Haskell, but typeclasses but I think there's just an element of elegance to first-class modules that can't be found with typeclasses. (Not the mention Haskell's horridly bare-bones module system.)