Time left $2$:$57$:$18$

$22$

Given a weighted connected graph, the algorithm for finding the minimum spanning tree has the same complexity $($in big$-$Oh notation$)$ as the algorithm for finding the maximum spanning tree.

Select one:

True

False

Next page