题目内容
Suppose we are given an instance of the minmum spanning tree problem on a graph $G$, with edge costs that are all positive and distinct. Let $T$ be a minimum spanning tree for this instance. Now suppose we replace each edge cost $c_e$ by its square $c_e^2$, thereby creating a new instance of the problem with the same graph but different costs. Decide whether you think the following statement is true or false.$T$ must still be a minimum spanning tree for this new instance.
查看答案
搜索结果不匹配？点我反馈
更多问题
An algorithm has running time $T(n)$, which satisfies $T(n) = 4T(n/4) + O(n)$.So, its running time is _____.
If an algorithm has running time $T(n)= O(n\log n)$, then $T(n)$ may most likely satisfy that _____.
Under the same condition as exercise 3.Then, there is not a minimum spanning tree of [mathjaxinline]G[/mathjaxinline] that doesn’t contain the edge [mathjaxinline]e[/mathjaxinline].
Assume that each of the following sets are not equal. Which one is the biggest set?
微信支付 
支付宝支付