| definition: |
addNode :: Node -> Graph -> (Graph,NodeID) addNode node (Graph nodes mx root) = (Graph (nodes ++ [(mx,node)]) (mx + 1) root, mx) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
-- Adds a new node in a graph. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{Graph}) |-> {(,)}}
|
| name: |
addNode |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
Node -> Graph -> (Graph, Prelude.Int) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |