0 of 2 Questions completed
Questions:
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 2 Questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 point(s), (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
1、6 个顶点的连通图的最小生成树,其边数为( )。 (2014年提高组)
2、下图给出了一个加权无向图,从顶点 V0 开始用 prim 算法求最小生成树。则依次加入最小生成树的顶点集合的顶点序列为: (2009年真题)