intmap-graph: A graph library that allows to explore edges after their type
It is easiest to explain this library with an example: A node has 300 outgoing edges, 100 red, 100 green, 100 blue. If you want to explore all green edges, most of the other graph libraries force you to look up all 300 edges and then filter after the property green. This means 300 O(log n) calls. With this library there is only one (log n) call necessary that gives a list of all green edges.
[Skip to Readme]
Downloads
- intmap-graph-1.3.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 1.0, 1.0.0.1, 1.1.0.0, 1.2.0.0, 1.3.0.0 |
|---|---|
| Dependencies | base (>=4 && <5), containers, text, vector, word8 [details] |
| License | BSD-3-Clause |
| Copyright | 2019 Tillmann Vogt |
| Author | Tillmann Vogt |
| Maintainer | tillk.vogt@gmail.com |
| Category | graphs |
| Home page | https://github.com/tkvogt/intmap-graph#readme |
| Source repo | head: git clone https://github.com/tkvogt/intmap-graph |
| Uploaded | by TillmannVogt at 2020-08-28T15:07:06Z |
| Distributions | NixOS:1.3.0.0 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1348 total (19 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2020-08-28 [all 1 reports] |