| definition: |
dgraphWithAttrs :: String -> [(String,String)] -> [Node] -> [Edge] -> DotGraph dgraphWithAttrs = DGraph |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Constructs a directed graph from a name, a list of attributes,
--- and lists of nodes and edges.
--- The attributes are graph attributes of the DOT language, e.g.,
--- `[("ordering","out"), ("fontsize","10")]`.
|
| failfree: |
() |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{() |-> {DGraph}}
|
| name: |
dgraphWithAttrs |
| precedence: |
no precedence defined |
| result-values: |
{DGraph}
|
| signature: |
String -> [(String, String)] -> [Node] -> [Edge] -> DotGraph |
| solution-complete: |
operationally complete operation |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |