The **in-degree** of a vertex \(V\) of a graph is the number of paths entering \(V\). Thus, a vertex with **in-degree** of \(0\) is called a source. Given an adjacency list representation of a graph \(G =( V,E)\), how much time does it take to compute the **in-degree** of every vertex?

×

Problem Loading...

Note Loading...

Set Loading...