<digraph> ( -- graph ) - Factor Documentation

<digraph> ( -- graph )
Graphviz » Graphviz data structures

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

Vocabulary
graphviz

Inputs
None

Outputs

graph

a graph

Word description
Constructs an empty, non-strict, directed graph.

Notes
Because it's rare for graph id s to be meaningful or useful, <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,

<digraph> "G" >>id

Examples

USING: graphviz prettyprint ; <digraph> graph? .
t

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

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

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

See also
graph, <graph>, <strict-graph>, <strict-digraph>

Definition

USING: accessors ;

IN: graphviz

: <digraph> ( -- graph ) <graph> t >>directed? ;