| definition: |
delNodes :: [Node] -> Graph a b -> Graph a b delNodes [] g = g delNodes (v:vs) g = delNodes vs (snd (match v g)) |
| demand: |
arguments 1 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Remove multiple 'Node's from the 'Graph'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({[]},_) |-> _ || ({:},_) |-> _}
|
| name: |
delNodes |
| precedence: |
no precedence defined |
| result-values: |
_ |
| 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 |