name: unordered-graphs version: 0.1.0 synopsis: Graph library using unordered-containers description: Simple graph library allowing any Hashable instance to be a node type. license: MIT license-file: LICENSE author: Ivan Lazar Miljenovic maintainer: Ivan.Miljenovic@gmail.com -- copyright: category: Data Structures, Graphs build-type: Simple extra-source-files: README.md cabal-version: >=1.10 source-repository head type: git location: https://github.com/ivan-m/unordered-graphs library exposed-modules: Data.Graph.Unordered , Data.Graph.Unordered.Algorithms.Clustering , Data.Graph.Unordered.Algorithms.Components , Data.Graph.Unordered.Algorithms.Subgraphs , Data.Graph.Unordered.Internal -- other-modules: -- other-extensions: build-depends: base >=4.8 && <4.9 , deepseq >= 1.4.0.0 , dlist >= 0.5 && < 0.8 , hashable , unordered-containers == 0.2.* hs-source-dirs: src default-language: Haskell2010 ghc-options: -Wall ghc-prof-options: -prof