| definition: |
constructDGGraph :: Graph -> NodeID -> DGGraph constructDGGraph graph root = constructDGGraph' (constructPredMap graph) M.empty graph root |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
Construct a graph for drawing from a graph |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {:,[]}}
|
| name: |
constructDGGraph |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
[Node] -> Prelude.Int -> [DGNode] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |