6. If a graph with n vertices forms a ring, it has () spanning trees.
A. n
B. n-1
C. n+1
D. Unclear
查看答案
7. The minimum spanning tree of any undirected connected network ().
A. have one or more
B. only one
C. more
D. may not exist
8. To determine whether there is a loop in a digraph, you can use ().
A. Depth-first traversal algorithm
B. The critical path method
C. Dijkstra
D. Breadth-first traversal algorithm
9. Assuming that graph G has n vertices and e edges and adopts adjacency table storage, the time complexity of the topological sorting algorithm is ().
A. O(n+e)
B. O(n)
C. O(e)
D. O(n*e)
10. The following incorrect statement is ().
A. If any key activity is completed ahead of time, the whole project will be completed ahead of time
B. Key activities not completed on time will affect the completion time of the whole project
C. All key activities are completed in advance, then the entire project is completed in advance
D. Early completion of certain key activities will lead to early completion of the entire project
微信支付 
支付宝支付