Kruskal's Algorithm

Category: Graphs

Difficulty: advanced

Description: Find minimum spanning tree

Time Complexity: O(E log E)

Space Complexity: O(V)

Related LeetCode Problems

• 1584. Min Cost to Connect All Points (Medium)
• 1168. Optimize Water Distribution in a Village (Medium)
• 1135. Connecting Cities With Minimum Cost (Medium)
• 1631. Path With Minimum Effort (Medium)
• 1585. Check If String Is Transformable With Substring Sort Operations (Hard)
• 1584. Min Cost to Connect All Points (duplicate) (Medium)
• 1135. Connecting Cities With Minimum Cost (duplicate) (Medium)
• 1168. Optimize Water Distribution in a Village (duplicate) (Medium)
• 997. Find the Town Judge (Easy)