Name: planar-graph
Version: 1.0.0.0
Synopsis: A representation of planar graphs
Description: {
Planar graphs are graphs that can be embedded onto a surface
(i.e. they can be drawn on that surface without any edges crossing).
As such, it is preferable to use a dedicated data structure for them
that has information about how to achieve this embedding rather than a
standard graph data structure.
.
(Please note however that this implementation has only been tested in
terms of the embedding being on the unit sphere or disc; whether it
works or not as-is on any other type of surface is unknown.)
}
License: BSD3
License-file: LICENSE
Author: Ivan Lazar Miljenovic
Maintainer: Ivan.Miljenovic@gmail.com
Category: Data, Maths, Graphs
Build-type: Simple
Cabal-version: >=1.6
Source-Repository head
type: darcs
location: http://code.haskell.org/~ivanm/planar-graph
Library
Exposed-modules: Data.Graph.Planar
Data.Graph.Planar.Serialisation
Data.Graph.Planar.Serialisation.PlanarCode
Data.Graph.Planar.Serialisation.AsciiCode
-- Exposed but not recommended for use.
Data.Graph.Planar.Internal
Other-modules: Data.Graph.Planar.Serialisation.Internal
Build-depends: base < 5,
containers < 0.6,
array,
transformers,
data-clist >= 0.0.7.2 && <0.1,
dlist == 0.5.*,
deepseq >= 1.1 && < 1.4,
bytestring < 0.11,
blaze-builder == 0.3.*,
attoparsec == 0.10.*
GHC-Options: -funbox-strict-fields -Wall
GHC-Prof-Options: -auto-all -caf-all