Data, Model and Decision答案2023

第六章测试

1.In terms of graph theory, the following statement is incorrect ( ).
A:If a tree has n nodes, the number of its edges is n-1.
B:Nodes in a tree may not be connected to each other.
C:If an edge is removed from a tree, the tree won’t be connected.
D:If there is one more edge in the tree, there must be a circle.

答案:B
2.There are ( ) odd vertices in the graph.
A:1 B:4
C:2 D:3 3.In order to get the minimal spanning tree of this graph by Kruskal Algorithm, the number of remaining edges is (D), and in ascending order of weight, we should remain the edge ( ) with the weight of 5 in order to avoid circle.
A:5; (v3, v4)
B:6; (v2, v3)
C:5; (v2, v3)
D:6; (v1, v4)
4.Dijkstra algorithm is only used to calculate the shortest route from the first vertex v1 to other vertices. ( ）
A:错 B:对 5.The Bellman algorithm can be used to find out the shortest route from v1 to any vertex, even the weight being negative. （ ）
A:对 B:错