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