| definition: |
graphRoot :: Graph -> NodeID graphRoot (Graph _ _ nid) = nid |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Graph}) |-> _}
|
| name: |
graphRoot |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph -> Prelude.Int |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |