A directed graph with an vertices and e edges are represented by adjancy matrix. What is the time required to determine the in-degree of a vertex?
A directed graph with an vertices and e edges are represented by adjacency matrix. 0(n) is the time required to determine the in-degree of a vertex.
A directed graph is a set of vertices and a collection of directed edges that each connects an ordered pair of vertices. We say that a directed edge points from the first vertex in the pair and points to the second vertex in the pair.