name:                intmap-graph
version:             1.3.0.0
Synopsis:            A graph library that allows to explore edges after their type
Description:         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.
homepage:            https://github.com/tkvogt/intmap-graph#readme
license:             BSD3
license-file:        LICENSE
author:              Tillmann Vogt
maintainer:          tillk.vogt@gmail.com
copyright:           2019 Tillmann Vogt
category:            graphs
build-type:          Simple
extra-source-files:  README.md
cabal-version:       >=1.10

library
  hs-source-dirs:      src
  exposed-modules:     Graph.IntMap
  build-depends:       base == 4.*
                     , containers
                     , text
                     , vector
                     , word8

  default-language:    Haskell2010

source-repository head
  type:     git
  location: https://github.com/tkvogt/intmap-graph