fgl
A Functional Graph Library for Haskell (by haskell)
psqueues
Priority Search Queues in three different flavors for Haskell (by jaspervdj)
Our great sponsors
| fgl | psqueues | |
|---|---|---|
| 2 | 1 | |
| 165 | 61 | |
| 0.0% | - | |
| 0.0 | 2.5 | |
| about 1 month ago | 6 months ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | 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 2021-12-11.
-
-🎄- 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.
psqueues
Posts with mentions or reviews of psqueues.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-14.
-
-🎄- 2021 Day 15 Solutions -🎄-
A super-ugly Dijkstra implementation with psqueues for priority queues. Before I took them into use the first part took ~10 sec, after that it's ~60ms, and 2.5s for the second part. I believe, there's still room for optimization, but it's enough for today.
What are some alternatives?
When comparing fgl and psqueues you can also consider the following projects:
miso - :ramen: A tasty Haskell front-end framework
containers - Assorted concrete container types
adjunctions - Simple adjunctions
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
distributive - Dual Traversable
Agda - Agda is a dependently typed programming language / interactive theorem prover.
graphite - Haskell graphs and networks library
selections - Haskell Package for operating with selections over an underlying functor
graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface
vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.