知到答案Data, Model and Decision智慧树答案_2022年

第六章

In terms of graph theory, the following statement is incorrect ( ).
答案:Nodes in a tree may not be connected to each other.
There are ( ) odd vertices in the graph.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.Dijkstra algorithm is only used to calculate the shortest route from the first vertex v1 to other vertices. ( ）The Bellman algorithm can be used to find out the shortest route from v1 to any vertex, even the weight being negative. （ ）