fgl
A Functional Graph Library for Haskell (by haskell)
adjunctions
Simple adjunctions (by ekmett)
| fgl | adjunctions | |
|---|---|---|
| 5 | 1 | |
| 188 | 45 | |
| 0.0% | - | |
| 4.7 | 5.0 | |
| 7 months ago | about 1 month ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | BSD 2-clause "Simplified" 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.
-
N-ary Tree data structure with efficient parent access?
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
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
Couple of approaches to graphs that are state-free: functional graphs and algebraic graphs
-
-🎄- 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.
adjunctions
Posts with mentions or reviews of adjunctions.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-16.
-
Version 0.6 of Flat, a principled, portable and compact binary data format
To specify a representing type I can generically derive Representable via More a `ShapedBy` [a].
What are some alternatives?
When comparing fgl and adjunctions you can also consider the following projects:
psqueues - Priority Search Queues in three different flavors for Haskell
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
ethereum-client-haskell
containers - Assorted concrete container types
distributive - Dual Traversable
graphite - Haskell graphs and networks library