（是非題）Given an adjacency-list representation of a directed graph $G=(V,E,w)$, it takes $O(V)$ time to compute the in-degree of every vertex.