<strict-digraph> ( -- graph )

Graphviz ยป Graphviz data structures

Graphviz ยป Graphviz data structures

Prev: | <strict-graph> ( -- graph ) |

Next: | <subgraph> ( id -- subgraph ) |

Vocabulary

graphviz

Inputs

None

Outputs

Word description

Constructs an empty, strict, directed graph.

Notes

Because it's rare for graph ids to be meaningful or useful, <strict-digraph> automatically generates one, just as in <anon>.

If you want, you can still give the resulting graph a specific id using standard words like >>id. For example,

In strict graphs, there is at most one edge between any two nodes, so duplicates are ignored by Graphviz.

Examples

See also

graph, <graph>, <digraph>, <strict-graph>

Definition

graphviz

Inputs

None

Outputs

graph | a graph |

Word description

Constructs an empty, strict, directed graph.

Notes

Because it's rare for graph ids to be meaningful or useful, <strict-digraph> automatically generates one, just as in <anon>.

If you want, you can still give the resulting graph a specific id using standard words like >>id. For example,

<strict-digraph> "G" >>id

In strict graphs, there is at most one edge between any two nodes, so duplicates are ignored by Graphviz.

Examples

USING: graphviz prettyprint ;
<strict-digraph> graph? .

t

t

USING: accessors graphviz prettyprint sequences ;
<strict-digraph> statements>> empty? .

t

t

USING: accessors graphviz prettyprint ;
<strict-digraph> strict?>> .

t

t

USING: accessors graphviz prettyprint ;
<strict-digraph> directed?>> .

t

t

See also

graph, <graph>, <digraph>, <strict-graph>

Definition