License | GPL-3 |
---|---|
Maintainer | Marcelo Garlet Millani <marcelogmillani@gmail.com> |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe |
Language | Haskell2010 |
Basic data structures for representing DOT files.
Synopsis
- data GraphType
- data Name
- data Statement
- = EdgeStatement [Subgraph] [(Name, Name)]
- | NodeStatement Name (Maybe Port) [(Name, Name)]
- | SubgraphStatement Subgraph
- | AttributeStatement (Name, Name)
- | EdgeAttribute [(Name, Name)]
- | NodeAttribute [(Name, Name)]
- | GraphAttribute [(Name, Name)]
- data Subgraph
- data Port = Port (Maybe Name) (Maybe Compass)
- data Compass
- data GraphElement
Documentation
EdgeStatement [Subgraph] [(Name, Name)] | |
NodeStatement Name (Maybe Port) [(Name, Name)] | |
SubgraphStatement Subgraph | |
AttributeStatement (Name, Name) | |
EdgeAttribute [(Name, Name)] | |
NodeAttribute [(Name, Name)] | |
GraphAttribute [(Name, Name)] |
data GraphElement Source #
Simple representation of a graph considering only the adjacency of nodes.
Instances
Eq GraphElement Source # | |
Defined in Language.Dot.Graph (==) :: GraphElement -> GraphElement -> Bool # (/=) :: GraphElement -> GraphElement -> Bool # | |
Show GraphElement Source # | |
Defined in Language.Dot.Graph showsPrec :: Int -> GraphElement -> ShowS # show :: GraphElement -> String # showList :: [GraphElement] -> ShowS # |