| definition: |
emptyGraph :: Graph emptyGraph = Graph [(0, ConsNode "null" [])] 1 1 |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
-- An empty graph contains only a "null" node with node id 0. |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {Graph}}
|
| name: |
emptyGraph |
| precedence: |
no precedence defined |
| result-values: |
{Graph}
|
| signature: |
Graph |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |