IntGraph
Dynamically sized graphs (by sam-barr)
data-forest
A simple multi-way tree data structure (by typeclasses)
| IntGraph | data-forest | |
|---|---|---|
| - | - | |
| 2 | 1 | |
| - | - | |
| 0.0 | 2.0 | |
| over 6 years ago | 2 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | Apache License 2.0 |
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.
IntGraph
Posts with mentions or reviews of IntGraph.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning IntGraph yet.
Tracking mentions began in Dec 2020.
data-forest
Posts with mentions or reviews of data-forest.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning data-forest yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing IntGraph and data-forest you can also consider the following projects:
treap - :leaves: :deciduous_tree: :fallen_leaf: Efficient implementation of the implicit treap data structure
data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet
red-black-tree - Red Black Trees implemented in Haskell
data-r-tree - Haskell implementatio of R-Trees
slist - ♾️ Sized list
data-clist - A purely functional ring data structure for Haskell.