| definition: |
delNode :: Node -> Graph a b -> Graph a b delNode v = delNodes [v] |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Remove a 'Node' from the 'Graph'. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {delNodes}}
|
| name: |
delNode |
| precedence: |
no precedence defined |
| result-values: |
{delNodes}
|
| signature: |
Prelude.Int -> Graph a b -> Graph a b |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |