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

[ bsd3, library, web ] [ 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]
Versions [faq] 1.0
Dependencies base (==4.*), containers, text, vector, word8 [details]
License BSD-3-Clause
Copyright 2019 Tillmann Vogt
Author Tillmann Vogt
Maintainer tillk.vogt@gmail.com
Category Web
Home page https://github.com/tkvogt/intmap-graph#readme
Source repo head: git clone https://github.com/tkvogt/intmap-graph
Uploaded by TillmannVogt at Fri Oct 11 22:03:54 UTC 2019
Distributions NixOS:1.0
Downloads 47 total (22 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2019-10-11 [all 1 reports]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for intmap-graph-1.0

[back to package description]