题目内容

b) There is not a minimum spanning tree of $G$ that doesn’t contain the edge $e$.

A. 正确
B. 错误

查看答案

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

更多问题

Decide whether you think the following statements are true or false.Let $G$ be an arbitrary connected, undirected graph with a distinct cost on every edge. Suppose $e$ is the cheapest edge in $G$. Then,a) There is a minimum spanning tree of $G$ that contains the edge $e$.

A. 正确
B. 错误

$f=\Omega(g)\ $ and $g=\Omega(h)$, then $f=\ $_____.

A. $O(h)$
B. $\Omega(h)$
C. $\Theta(h)$

For every $r>1$, $r^n=$_____.

A. $O(n^2)$
B. $\Omega(\sqrt n)$
C. $\Theta(n^r)$

$f(n) = n^3 + 2n^2 + 1$ is _____.

A. $\Omega (n^4)$
B. $O (n^2)$
C. $\Theta (n^3)$