已知一个图的顶点集V各边集G如下:V = {0,1,2,3,4,5,6,7,8,9};E = {0,1),(0,4),(1,2),(1,7),(2,8),(3,4),(3,8),(5,6),(5,8),(5,9),(6,7),(7,8),(8,9)},当它用邻接表表示时(按顶点序号从大到小的次序链接),请写出从顶点V0出发按广度优先搜索遍历等到的顶点序列________________。
A. 0,1,2,8,3,4,5,6,7,9
B. 0,1,4,2,7,3,8,6,5,9
C. 0,4,3,8,9,5,6,7,1,2
D. 0,4,1,3,7,2,8,6,9,5