intmap-graph: A graph library that allows to explore edges after their type

[ bsd3, graphs, library ] [ Propose Tags ]

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]


[Index] [Quick Jump]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 1.0,,,,
Dependencies base (>=4 && <5), containers, text, vector, word8 [details]
License BSD-3-Clause
Copyright 2019 Tillmann Vogt
Author Tillmann Vogt
Category graphs
Home page
Source repo head: git clone
Uploaded by TillmannVogt at 2020-08-28T15:07:06Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1234 total (21 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]

Readme for intmap-graph-

[back to package description]