（是非題）Given a weighted directed graph $G=(V,E,w)$ with no negative-weight edges, we can solve its single source shortest path problem in $O(V+E)$ time.