It\'s a textbook algorithm and showed up in LeetCode problems and contests.\n\nExamples: \n* [1584. Min Cost to Connect All Points (Medium)](https://leetcode.com/problems/min-cost-to-connect-all-points/)\n* [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (Hard)](https://leetcode.com/problems/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/)

It\'s a textbook algorithm and showed up in LeetCode problems and contests.\n\nExamples: \n 1584. Min Cost to Connect All Points (Medium)\n 1489. Find Critical 