Graph basics III
The
in-degree
of a vertex
of a graph is the number of paths entering
. Thus, a vertex with
in-degree
of
is called a source. Given an adjacency list representation of a graph
, how much time does it take to compute the
in-degree
of every vertex?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!