CurryInfo: icurry-3.2.0 / TermGraph.SVG.constructDGraph

definition: Info
 
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: Info
 no demanded arguments
deterministic: Info
 deterministic operation
documentation: Info
 
Construct a linked tree for drawing from an unlinked graph
returns the tree and its depth
failfree: Info
 <FAILING>
indeterministic: Info
 referentially transparent operation
infix: Info
 no fixity defined
iotype: Info
 {(_,_,_) |-> {(,)}}
name: Info
 constructDGraph
precedence: Info
 no precedence defined
result-values: Info
 {(,)}
signature: Info
 Prelude.Int -> [Node] -> Prelude.Int -> (DNode, Prelude.Int)
solution-complete: Info
 operation might suspend on free variables
terminating: Info
 possibly non-terminating
totally-defined: Info
 possibly non-reducible on same data term