| definition: |
fullGraphToDot :: Graph -> [(NodeID,[(String,String)])] -> Bool -> DotGraph
fullGraphToDot (Graph nodes _ _) ndattrs withnids =
dgraphWithAttrs "Graph"
[("ordering","out"), ("fontsize","10")]
(concatMap toNode nodes) (concatMap toEdges nodes)
where
toNode (nid,n) = [Dot.Node (show nid) ([("label", ndlabel)] ++ addAttrs)]
where
ndlabel = nodeLabel n ++ if withnids then " [" ++ show nid ++ "]" else ""
addAttrs = maybe [] id (lookup nid ndattrs)
toEdges (nid, FuncNode _ ns ) = addEdges nid ns
toEdges (nid, ConsNode _ ns ) = addEdges nid ns
toEdges (nid, PartNode _ _ ns ) = addEdges nid ns
toEdges (nid, ChoiceNode _ n1 n2) = addEdges nid [n1,n2]
toEdges (_ , FreeNode ) = []
addEdges src ns =
map (\ (i,n) -> Dot.Edge (show src) (show n) [("label",show i)])
(zip [1..] ns)
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
-- Transforms a graph (w.r.t. given node attributes) into a dot graph. -- If the third argument is True, node ids will be shown in the node labels. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Graph},_,_) |-> _}
|
| name: |
fullGraphToDot |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph -> [(Prelude.Int, [(String, String)])] -> Prelude.Bool -> Data.GraphViz.DotGraph |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |