11. The critical path is in the event node network is ().
A. The longest path from the source to the sink
B. Longest loop
C. The shortest path from the source to the sink
D. Shortest loop
查看答案
12. Graph G is a non-connected undirected graph with 28 edges in total, so the graph has at least () vertices.
A. 9
B. 8
C. 10
D. 11
13. Given the adjacency matrix representation of a graph, the method to delete all the starting points from the i-th vertex is ().
A. Set all the elements on the i-th row of the matrix to 0
B. Set all the elements on the i-th column of the matrix to 0
C. Delete the i-th row of the matrix, and move the subsequent rows up
Delete the i-th column of the matrix, and move the subsequent column up
14. Depth-first traversal is similar to binary tree ().
A. Traversal
B. Preorder traversal
C. In-order traversal
D. Post-order traversal
15. Breadth-first traversal is similar to binary tree ().
A. Preorder traversal
B. In-order traversal
C. Post-order traversal
D. Traversal
微信支付 
支付宝支付