Leetcode 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Determine which edges in a weighted undirected graph are critical (appear in every MST) or pseudo-critical (appear in some but not all MSTs) by comparing MST costs when each edge is excluded or forcibly included. This requires repeated MST computations (e.g., Kruskal with Union-Find) and careful handling of equal-weight ties.