File: GraphSCC.cabal

package info (click to toggle)
haskell-graphscc 1.0.4-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 64 kB
  • sloc: haskell: 192; makefile: 4
file content (32 lines) | stat: -rw-r--r-- 936 bytes parent folder | download | duplicates (5) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
 
Name:             GraphSCC
Version:          1.0.4
License:          BSD3
License-file:     LICENSE
Author:           Iavor S. Diatchki
Maintainer:       diatchki@galois.com
Category:         Algorithms
Synopsis:         Tarjan's algorithm for computing the strongly connected components of a graph.
Description:      Tarjan's algorithm for computing the strongly connected components of a graph.
Build-type:       Simple
Cabal-Version:    >= 1.6

flag use-maps
  default: False
  description: Use IntMap instead of mutable arrays.

library
  Build-Depends:    base < 10, array, containers
  Exposed-modules:  Data.Graph.SCC
  Extensions:       CPP
  GHC-options:      -O2 -Wall
  if flag(use-maps)
    Other-modules:  Data.Graph.MapSCC
    cpp-options: -DUSE_MAPS
  else
    Extensions:     Rank2Types
    Other-modules:  Data.Graph.ArraySCC

source-repository head
  type:        git
  location:    git://github.com/yav/GraphSCC.git