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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

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]

Properties

Versions1.0, 1.0
Change logNone available
Dependenciesbase (==4.*), containers, text, vector, word8 [details]
LicenseBSD-3-Clause
Copyright2019 Tillmann Vogt
AuthorTillmann Vogt
Maintainertillk.vogt@gmail.com
CategoryWeb
Home pagehttps://github.com/tkvogt/intmap-graph#readme
Source repositoryhead: git clone https://github.com/tkvogt/intmap-graph
UploadedFri Oct 11 21:53:57 UTC 2019 by TillmannVogt

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees


Readme for intmap-graph-1.0

[back to package description]