<strict-graph> ( -- graph )

Graphviz ยป Graphviz data structures

Graphviz ยป Graphviz data structures

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

Next: | <strict-digraph> ( -- graph ) |

Vocabulary

graphviz

Inputs

None

Outputs

Word description

Constructs an empty, strict, undirected graph.

Notes

Because it's rare for graph id s to be meaningful or useful, <strict-graph> 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 graph s, there is at most one edge between any two node s, so duplicates are ignored by Graphviz.

Examples

See also

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

Definition

graphviz

Inputs

None

Outputs

graph | a graph |

Word description

Constructs an empty, strict, undirected graph.

Notes

Because it's rare for graph id s to be meaningful or useful, <strict-graph> 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 graph s, there is at most one edge between any two node s, so duplicates are ignored by Graphviz.

Examples

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

t

t

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

t

t

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

t

t

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

f

f

See also

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

Definition