| definition: |
ugraph :: String -> [Node] -> [Edge] -> DotGraph ugraph name nodes edges = UGraph name [] nodes edges |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Constructs an undirected graph from a name and a list of nodes and edges. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> {UGraph}}
|
| name: |
ugraph |
| precedence: |
no precedence defined |
| result-values: |
{UGraph}
|
| signature: |
String -> [Node] -> [Edge] -> DotGraph |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |