Information Technology Reference
In-Depth Information
Ta b l e 5 . 1 8
The inductive definition of simple oriented graph over the set
A
If
a
∈
A
then
a
∈
G
(
A
)
.
If
G
∈
G
(
A
)
,
a
∈
A
and
a
is not a node of
G
(
a
∈
G
), then the graph denoted
by
(
G
+
a
)
belongs to
G
(
A
)
, where the node
a
is added as new node disconnected
from the nodes of
G
. Moreover, if
G
∈
G
(
A
)
,
a
,
b
∈
G
and
a
is not connected to
b
in
G
, then the graph denoted by
(
G
+(
a
,
b
))
belongs to
G
(
A
)
, where the edge connecting
a
to
b
is added to
G
.
Fig. 5.7
Construction of a new tree from three already given trees
Fig. 5.8
Extending a graph with a new node (top) and with a new arc (down)
