为什么DFS和BFS O(V + E)的时间复杂度

The basic algorithm for BFS:

BFS的基本算法:

set start vertex to visited

load it into queue

while queue not empty

   for each edge incident to vertex

        if its not visited

            load into queue

            mark vertex
set