Prim's Algorithm

Category: Graphs

Difficulty: advanced

Description: Find MST using greedy approach

Time Complexity: O(E log V)

Space Complexity: O(V)

Related LeetCode Problems

• 1584. Min Cost to Connect All Points (Medium)
• 1135. Connecting Cities With Minimum Cost (Medium)
• 1168. Optimize Water Distribution in a Village (Medium)
• 1585. Check If String Is Transformable With Substring Sort Operations (Hard)
• 997. Find the Town Judge (Easy)
• 1586. Stone Game VII (Medium)
• 113. Path Sum II (Medium)
• 1191. K-Concatenation Maximum Sum (Hard)