psqueues VS igraph

Compare psqueues vs igraph and see what are their differences.

psqueues

Priority Search Queues in three different flavors for Haskell (by jaspervdj)

igraph

Incomplete Haskell bindings to the igraph library (which is written in C) (by giorgidze)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
psqueues igraph
1 -
63 7
- -
5.2 0.0
6 months ago over 11 years 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.

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 -🎄-
    127 projects | /r/adventofcode | 14 Dec 2021
    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.

igraph

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

We haven't tracked posts mentioning igraph yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing psqueues and igraph you can also consider the following projects:

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

containers - Assorted concrete container types

fgl - A Functional Graph Library for Haskell

nonempty-containers - Efficient non-empty variants of containers data types, with full API

hevm - Dapp, Seth, Hevm, and more

heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

graphite - Haskell graphs and networks library

distributive - Dual Traversable

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

ethereum-client-haskell