题目内容

18. The minimal spanning tree can be constructed using the () algorithm.

A. Prim algorithm
B. Kruskal algorithm
C. Huffman algorithm
Dijitstra algorithm

查看答案

搜索结果不匹配？点我反馈

更多问题

19. In a graph with n vertex e-edges, the sum of degrees of all vertices is equal to ().

A. 2n
B. n
C. e
D. 2e

Sort the sequence {15, 9, 7, 8, 20, -1, 4}, and after one pass, the data arrangement becomes {9, 15, 7, 8, 20, -1, 4}, then The sorting method used is _____.

A. selection sort
B. Direct insertion sort
C. heap sort
D. hill sort

The advantages of sequential storage are large storage density and high efficiency of insertion and deletion.()

Given the bidirectional circular linked list L of the leading node, the condition to judge it as an empty table is l-> next==L && l-> prior==L.()