Question: 2. Given digraph G, present an O(m + n) time algorithm to compute the in-degree of every vertex in G. You may use array inDeg[1]
2. Given digraph G, present an O(m + n) time algorithm to compute the in-degree of every vertex in G. You may use array inDeg[1] inDeg[n] to record the in-degrees so that inDeg[v] stores the in-degree of vertex v.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
