[数据结构]Graph之入度与出度计算

template<int max_size>
int Graph<max_size>::in_degree(Vertex v) const
{
int in_degree = 0;
for (int i = 0; i < count; i++) {
for (int j = 0; j < neighbours[i].size(); j++) {
Vertex x;
neighbours[i].retrieve(j, x);
if (x == v)in_degree++;
}
}
return in_degree;
}

template<int max_size>
int Graph<max_size>::out_degree(Vertex v) const
{
return (neighbours[v].size());
}