| definition: |
equal :: (Eq a, Eq b) => Graph a b -> Graph a b -> Bool equal g g' = slabNodes g == slabNodes g' && slabEdges g == slabEdges g' |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- graph equality |
| failfree: |
(_, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> _}
|
| name: |
equal |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(Prelude.Eq a, Prelude.Eq b) => Graph a b -> Graph a b -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |