For each vertex in the graph for problem 1 list the in degre

For each vertex in the graph for problem 1, list the in degree and out degree.

Solution

Indegree of a Graph:

   It is counted as number of edges coming into the vertex V
  
  
Outdegree of a Graph:

   It is counted as number of edges going out from vertex V
  
  
Vertex A:
           It has two incoming edges from F, D. Therefore, Indegree is 2
           It has three outgoing edges to F, C, B. Therefore, Outdegree is 3
          
  
Vertex B:
           It has one incoming edge from A. Therefore, Indegree is 1
           It has two outgoing edges to C, D. Therefore, Outdegree is 2
          
  
Vertex C:
           It has five incoming edges from A, B, D, E, F. Therefore, Indegree is 5
           It has no outgoing edges. Therefore, Outdegree is 0
          
  
Vertex D:
           It has two incoming edges from B, G. Therefore, Indegree is 2
           It has two outgoing edges to A, C. Therefore, Outdegree is 2

Vertex E:
           It has one incoming edges from G. Therefore, Indegree is 1
           It has two outgoing edges to C, G. Therefore, Outdegree is 2

Vertex F:
           It has one incoming edges from A. Therefore, Indegree is 1
           It has two outgoing edges to A, C. Therefore, Outdegree is 2

Vertex G:
           It has one incoming edges from E. Therefore, Indegree is 1
           It has two outgoing edges to D, E. Therefore, Outdegree is 2
          

          

Vertex	Indegree	Outdegree
A	2	3
B	1	2
C	5	0
D	2	2
E	1	2
F	1	2
G	1	2