| definition: |
insEdge :: Show a => LEdge b -> Graph a b -> Graph a b
insEdge (v,w,l) g = (pr,v,la,(l,w):su) :& g'
where (Just (pr,_,la,su),g') = match v g
|
| demand: |
arguments 2 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Insert a 'LEdge' into the 'Graph'. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{(,,)},_) |-> {Gr}}
|
| name: |
insEdge |
| precedence: |
no precedence defined |
| result-values: |
{Gr}
|
| signature: |
Prelude.Show b => (Prelude.Int, Prelude.Int, a) -> Graph b a -> Graph b a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |