| definition: |
delEdges :: Show a => [Edge] -> Graph a b -> Graph a b delEdges es g = foldr delEdge g es |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Remove multiple 'Edge's from the 'Graph'. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
delEdges |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Show a => [(Prelude.Int, 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 |