map-exts VS fgl

Compare map-exts vs fgl and see what are their differences.

fgl

A Functional Graph Library for Haskell (by haskell)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern API for authentication & user identity.
  • Onboard AI - ChatGPT with full context of any GitHub repo.
map-exts fgl
0 5
5 181
- 0.0%
0.0 7.5
almost 5 years ago about 1 month 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.

map-exts

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

We haven't tracked posts mentioning map-exts yet.
Tracking mentions began in Dec 2020.

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
    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.
  • -🎄- 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.

What are some alternatives?

When comparing map-exts and fgl 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

loc - Types representing line and column positions and ranges in text files

adjunctions - Simple adjunctions

bytestring-trie - An efficient finite map from (byte)strings to values.

miso - :ramen: A tasty Haskell front-end framework

distributive - Dual Traversable

ethereum-client-haskell

containers - Assorted concrete container types

representable-functors - representable functors

heaps - Asymptotically optimal Brodal/Okasaki heaps