Categorygithub.com/szhou12/leetcode-goleetcode1135-Connecting-Cities-With-Minimum-Cost
package
0.0.0-20241220224003-b7cf03a90b2b
Repository: https://github.com/szhou12/leetcode-go.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

1135. Connecting Cities With Minimum Cost

Solution idea

MST = Union Find + Kruskal

思路总结

  1. 比较直观的求 MST 的题。使用 Kruskal算法。

Time complexity = $O(E\log E)$