| definition: |
delEdge :: Show a => Edge -> Graph a b -> Graph a b
delEdge (v,w) g = case match v g of
(Nothing,_) -> g
(Just (p,v',l,s),g') -> (p,v',l,filter ((/=w).snd) s) :& g'
|
| demand: |
arguments 2 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Remove an 'Edge' from the 'Graph'. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{(,)},_) |-> _}
|
| name: |
delEdge |
| 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 |