fgl
A Functional Graph Library for Haskell (by haskell)
heaps
Asymptotically optimal Brodal/Okasaki heaps (by ekmett)
Our great sponsors
| fgl | heaps | |
|---|---|---|
| 5 | 1 | |
| 176 | 25 | |
| -0.6% | - | |
| 0.0 | 0.0 | |
| 4 months ago | 5 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" 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.
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.
-
Library for Tree-like data structure
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.
-
-🎄- 2021 Day 12 Solutions -🎄-
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 -🎄-
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.
We haven't tracked posts mentioning heaps yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing fgl and heaps you can also consider the following projects:
Agda - Agda is a dependently typed programming language / interactive theorem prover.
psqueues - Priority Search Queues in three different flavors for Haskell
adjunctions - Simple adjunctions
ethereum-client-haskell
distributive - Dual Traversable
miso - :ramen: A tasty Haskell front-end framework
containers - Assorted concrete container types
representable-functors - representable functors
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
helf - Haskell implementation of the Edinburgh Logical Framework
repa-array - High performance, regular, shape polymorphic parallel arrays.
bookkeeper