|
definition:
|
graphToDot :: Graph -> [(NodeID,[(String,String)])] -> Bool -> Bool -> DotGraph
graphToDot gr ndattrs withnids showall =
let sgraph = if showall then gr
else reachableGraph gr (map fst ndattrs)
in fullGraphToDot sgraph ndattrs withnids
|
|
demand:
|
arguments 1 4
|
|
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.
-- If the fourth argument is True, all nodes are shown, otherwise
-- only nodes reachable from the node list in the second argument are shown.
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
graphToDot
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Graph -> [(Prelude.Int, [(String, String)])] -> Prelude.Bool -> 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
|