graphite
Haskell graphs and networks library (by alx741)
psqueues
Priority Search Queues in three different flavors for Haskell (by jaspervdj)
| graphite | psqueues | |
|---|---|---|
| - | 1 | |
| 31 | 66 | |
| - | - | |
| 0.0 | 5.4 | |
| about 3 years ago | 4 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.
graphite
Posts with mentions or reviews of graphite.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning graphite yet.
Tracking mentions began in Dec 2020.
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 graphite and psqueues you can also consider the following projects:
bytestring-trie - An efficient finite map from (byte)strings to values.
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
bookkeeper
fgl - A Functional Graph Library for Haskell