(A “walk” is a sequence of edges, where the finish vertex of each edge is
the start vertex of the next edge).
Tree: A graph is said to be a “Tree” if it is connected and has no simple cycles.
(A “path” is a cycle if it starts and ends in the same node. A “simple cycle”
is one that does not repeat any nodes except for the first and last).
Directed Graph: The graph is said to be a “directed graph” if it has arrows in
stead of lines.
Outdegree: The number of arrows pointing from a particular node is the
“outdegree” of that node.
Indegree: The number of arrows pointing to a particular node is the
“indegree”.
Directed graphs (as shown in fig.) are an easy way of depicting binary
relations.
Introduction
17
Fig. A Tree
F
E
D
B
C
A
Fig. Directed Graph
the start vertex of the next edge).
Tree: A graph is said to be a “Tree” if it is connected and has no simple cycles.
(A “path” is a cycle if it starts and ends in the same node. A “simple cycle”
is one that does not repeat any nodes except for the first and last).
Directed Graph: The graph is said to be a “directed graph” if it has arrows in
stead of lines.
Outdegree: The number of arrows pointing from a particular node is the
“outdegree” of that node.
Indegree: The number of arrows pointing to a particular node is the
“indegree”.
Directed graphs (as shown in fig.) are an easy way of depicting binary
relations.
Introduction
17
Fig. A Tree
F
E
D
B
C
A
Fig. Directed Graph