A directed graph is a graph with directed edges connecting the vertices. E.g.: the following G(V,E) has V = {1, 2, 3, 4}, and E = {(1, 2), (2, 2), (2, 3), (3, 1), (3, 4), (4, 2)}
Let in-deg(v) = the # of incoming edges, and out-deg(v) = # of outgoing edges.
Answer the question.
? The sum of all in-degrees
? The sum of out-degrees
? Sum of in-degrees and out-degrees
? The length of an Eulerian path
a. 12
b. Undefined
c. 7
d. 14
e. 0
f.
g. 6
h. 5
i. 4