| definition: |
mkUGraph :: [Node] -> [Edge] -> Graph () () mkUGraph vs es = mkGraph (labUNodes vs) (labUEdges es) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Build a quasi-unlabeled 'Graph' from the list of 'Node's and 'Edge's. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
mkUGraph |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
[Prelude.Int] -> [(Prelude.Int, Prelude.Int)] -> Graph () () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |