Time complexity of undirected graph

259 Views Asked by At

What will be the Efficient way to find the degree of the specified vertex in an undirected graph (V,E)?

I'm thinking of O(|E|)