| definition: |
noNodes :: Graph _ _ -> Int noNodes (Gr g) = size g |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- The number of 'Node's in a 'Graph'. |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Gr}) |-> _}
|
| name: |
noNodes |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Graph a b -> Prelude.Int |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |