graphs | fgl | |
---|---|---|
1 | 5 | |
38 | 183 | |
- | 0.5% | |
10.0 | 6.6 | |
about 4 years ago | 19 days ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
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.
graphs
-
Library for Tree-like data structure
also faster than fgl/alga/hash-graphs if I read https://github.com/haskell-perf/graphs / https://github.com/haskell-perf/graphs/tree/master/results correctly
fgl
-
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.
What are some alternatives?
Agda - Agda is a dependently typed programming language / interactive theorem prover.
adjunctions - Simple adjunctions
psqueues - Priority Search Queues in three different flavors for Haskell
distributive - Dual Traversable
ethereum-client-haskell
miso - :ramen: A tasty Haskell front-end framework
heaps - Asymptotically optimal Brodal/Okasaki heaps
containers - Assorted concrete container types
representable-functors - representable functors
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)