| definition: |
neighbors :: Graph _ _ -> Node -> [Node] neighbors = (\(p,_,_,s) -> map snd (p++s)) .: context |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Find the neighbors for a 'Node'. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> _}
|
| name: |
neighbors |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph a b -> Prelude.Int -> [Prelude.Int] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |