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
16. In the representation of a graph, only has one representation is ().
Adjacency matrix representation
B. Adjacency list representation
C. Reverse adjacency list representation
D. Adjacency list and inverse adjacency list representation
1 In the case of randomly distributed of keywords, the search length of the binary sort tree method is on the order of magnitude of ( ）.
A. binary Search
B. sequential Search
C. blocking Search
D. hash Search
微信支付 
支付宝支付