题目内容

用Prim算法求一个连通的带权图的最小代价生成树,在算法执行的某时刻,已选取的顶点集合U={1,2,3},边的集合TE={(1,2),(2,3)},要选取下一条权值最小的边,不可能从__________组中选取。

A. {(1,4),(3,4),(3,5),(2,5)}
B. {(1,5),(2,4),(3,5)}
C. {(1,2),(2,3),(3,5)}
D. {(1,4),(3,5),(2,5),(3,4)}

查看答案

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

更多问题

用Kruskal算法求一个连通的带权图的最小代价生成树,在算法执行的某时刻,已选取的边集合TE={(1,2),(2,3),(3,5)},要选取下一条权值最小的边,可能选取的边__________。

A. (1,2)
B. (3,5)
C. (2,5)
D. (6,7)

若含有n个顶点的无向图恰好形成一个环,则它有__________棵生成树。

连通图的生成树包含了图中的所有顶点。

A. 对
B. 错

Task 1 Word SelectionFill in the blanks with words given below. Change the form where necessary.1. Sheisreluctanttodiscussthe_______oftheplay.2. _numerousfailures,theycontinuedtoconducttheexperiment.3. Themain_ofthemerchantbanksistoraisecapitalforindustry.4. Ihopeinyearstocomehewill_onhisdecision5. The temperature of this city _ from 0℃ to 30℃..6. You will be informed of the details at the _ time.7. Thenovelpresentsone_ofthereforminthecountryside.8. Whenweinvestinlearningand_,weinvestinhumandignity,developmentandpeace.9. We will resolutely our internationalist duty no matter whathappens.10. Thechildisvery_______andevenhisfathercannotmanagehim.