| definition: |
inn :: Graph _ b -> Node -> [LEdge b] inn g v = map (\(l,w)->(w,v,l)) (context1 g v) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Find all inward-bound 'LEdge's for the given 'Node'. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {:,[]}}
|
| name: |
inn |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
Graph a b -> Prelude.Int -> [(Prelude.Int, Prelude.Int, b)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |