6.(15分)Run the Kruskal's algorithm to find a minimum spanning tree for the following graph step by step.

8.(10分)Give an asymptotic upper bound for \( \mathrm{T(n)} = 7\mathrm{T}\left(\lfloor \mathrm{n} / 3\rfloor \right) + \mathrm{n}^2 \) where \( \mathrm{T(n)} \) is constant for \( \mathfrak{n} < 3 \). Your upper bound should be as tight as possible.

6.(15分)Run the Kruskal's algorithm to find a minimum spanning tree for the following graph step by step.

相關申論題

相關試卷