PROBLEM 4: GRAPH ALGORITHMS (30 POINTS) (a) 13 pts Recall the in-degree of a ver

Question

PROBLEM 4: GRAPH ALGORITHMS (30 POINTS) (a) 13 pts Recall the in-degree of a vertex w in a directed graph is the number of edges (, u) E V. Assume N(v)-(a | (v,x) E V). Modify the pseudocode below to calculate the in-degree of each vertex. procedure DFS (startV: a vertex of G) Initialize empty stack toInspect toInspect.push(startv) Initialized bool array visitedSet of size Ivl for (i:= 1 to n-1) visitedSet[i]false inDegree [i]0 while toInspect is not empty) vtoInspect.pop() if (visitedSet [v] -false) visitedSet [v] := true for each u in N(v) toInspect.push(u)

Explanation / Answer

dfs will visit the neighbours of vertices

=>for each u in N(v)
inDegree[u] = inDegree[u] + 1


Since the graph is directed , InDegree will be counted for incoming vertices hence we add for vertex v


In thsi way InDegree can be calculated

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.