16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
|
[list_begin definitions]
[call [cmd graphName] [arg option] [opt [arg "arg arg ..."]]]
[arg Option] and the [arg arg]s determine the exact behavior of the
command.
[list_end]
[para]
[emph Note:] A C-implementation of the command can be had from the
location [uri http://www.purl.org/NET/schlenker/tcl/cgraph]. See also
[uri http://wiki.tcl.tk/cgraph]. This implementation uses a bit less
memory than the tcl version provided here directly, and is faster.
|
<
<
<
<
<
<
<
<
|
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
[list_begin definitions]
[call [cmd graphName] [arg option] [opt [arg "arg arg ..."]]]
[arg Option] and the [arg arg]s determine the exact behavior of the
command.
[list_end]
[para]
A directed graph is a structure containing two collections of
elements, called [emph nodes] and [emph arcs] respectively, together
with a relation ("connectivity") that places a general structure upon
the nodes and arcs.
|
