VocabularygraphvizInputsNoneOutputsWord descriptionConstructs an empty, strict, undirected graph.NotesBecause 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.ExamplesUSING: graphviz prettyprint ;
<strict-graph> graph? .
t
USING: accessors graphviz prettyprint sequences ;
<strict-graph> statements>> empty? .
t
USING: accessors graphviz prettyprint ;
<strict-graph> strict?>> .
t
USING: accessors graphviz prettyprint ;
<strict-graph> directed?>> .
f
See alsograph, <graph>, <digraph>, <strict-digraph>Definition