一个无向图G={V,E},顶点集合V=(1,2,3,4,5,6,7),边集合E={(1,2),(1,3),(2,4),(3,4),(4,5),(4,6),(5,7),(6,7)},从定点1出发进行深度优先遍历,可得到的顶点序列是() 1,2,3,4,5,6,7 1,2,4,3,6,7,5 1,3,4,5,7,6,2 1,2,4,6,7,5,3
1,2,3,4,5,6,7
1,2,4,3,6,7,5
1,3,4,5,7,6,2
1,2,4,6,7,5,3