data-r-tree VS igraph

Compare data-r-tree vs igraph and see what are their differences.

data-r-tree

Haskell implementatio of R-Trees (by sebastian-philipp)
Data structures Data r-tree Haskell
Source Code
Suggest alternative
Edit details

igraph

Incomplete Haskell bindings to the igraph library (which is written in C) (by giorgidze)
Data structures
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
data-r-tree igraph
- -
12 7
- -
4.7 0.0
19 days ago over 11 years ago
Haskell Haskell
MIT 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.

data-r-tree

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

We haven't tracked posts mentioning data-r-tree yet.
Tracking mentions began in Dec 2020.

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 data-r-tree and igraph you can also consider the following projects:

data-forest - A simple multi-way tree data structure

containers - Assorted concrete container types

data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet

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

data-clist - A purely functional ring data structure for Haskell.

hevm - Dapp, Seth, Hevm, and more

permutation - git import of patrick perry permutations lib from darcs

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

distributive - Dual Traversable

tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.

monadic-arrays - MArray instances for monad transformers

data-r-tree vs data-forest igraph vs containers data-r-tree vs data-stringmap igraph vs nonempty-containers data-r-tree vs data-clist igraph vs hevm data-r-tree vs permutation igraph vs vinyl data-r-tree vs containers igraph vs distributive data-r-tree vs tie-knot igraph vs monadic-arrays