| definition: |
labEdges :: Graph _ b -> [LEdge b] labEdges (Gr g) = concatMap (\(v,(_,_,s))->map (\(l,w)->(v,w,l)) s) (toList g) |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- A list of all 'LEdge's in the 'Graph'. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Gr}) |-> _}
|
| name: |
labEdges |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph a b -> [(Prelude.Int, Prelude.Int, b)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |