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.
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
| Versions | 1.0, 1.0, 1.0.0.1, 1.1.0.0, 1.2.0.0, 1.3.0.0 |
|---|---|
| Change log | None available |
| 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 | 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 2019-10-11T21:53:57Z |
Modules
[Index] [Quick Jump]
- Graph
Downloads
- intmap-graph-1.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees