CurryInfo: icurry-3.2.0 / TermGraph.SVG.constructDGraph
definition: 
|
constructDGraph :: Int -> Graph -> NodeID -> (DNode, Int)
constructDGraph maxDepth graph root = (dGraph, min (1 + maxDepth - reached) maxDepth)
where
(dGraph, reached) = constructDGraph' graph (sharingColorMap graph [root] [] 0) maxDepth root
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Construct a linked tree for drawing from an unlinked graph returns the tree and its depth |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_) |-> {(,)}}
|
|
name:
|
constructDGraph |
|
precedence:
|
no precedence defined |
|
result-values:
|
{(,)}
|
|
signature:
|
Prelude.Int -> [Node] -> Prelude.Int -> (DNode, Prelude.Int) |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |