| definition: |
empty :: Graph _ _ empty = Gr Data.Map.empty |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- An empty 'Graph'. -- internal representation by finite maps |
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {Gr}}
|
| name: |
empty |
| precedence: |
no precedence defined |
| result-values: |
{Gr}
|
| signature: |
Graph a b |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |