<edge> ( tail head -- edge )
Graphviz » Graphviz data structures

Prev:	<node> ( id -- node )
Next:	add ( graph statement -- graph' )

Vocabulary
graphviz

Inputs

tail	an object
head	an object

Outputs

edge

an edge

Word description
Constructs an edge with the given tail and head, each of which must be either:

•	an array of objects supported by the present word, which is treated as an anonymous subgraph of nodes with corresponding ids;
•	a subgraph; or
•	any object supported by the present word, which is taken to be the id of a node.

Notes
There is more detailed information about how different tail and head types interact in the documentation for edge.

Examples

USING: accessors graphviz kernel prettyprint ; 1 "one" <edge> [ tail>> . ] [ head>> . ] bi
"1" "one"

USING: accessors classes graphviz kernel prettyprint strings ; 1 { 2 3 4 } <edge> [ tail>> class-of . ] [ head>> class-of . ] bi
string subgraph

USING: accessors graphviz kernel prettyprint ; <anon> <anon> <edge> [ tail>> id>> ] [ head>> id>> ] bi = .
f

See also
edge

Definition

USING: arrays graphviz.attributes kernel present ;

IN: graphviz

: <edge> ( tail head -- edge )
    [
        dup array?
        [ <anon> swap add-nodes ]
        [ dup subgraph? [ present ] unless ] if
    ] bi@ <edge-attributes> edge boa ;