#652 · #1489 · Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree(找到最小生成树里的关键边和伪关键边)

You are given a weighted undirected graph with n nodes and edges[i] = [u, v, w]. Return a list of two lists: the indices of the critical edges (in every MST) and the pseudo-critical edges (in some MST but not all). Constraints: 2 <= n <= 100, 1 <= edges.length <= min(200, n*(n-1)/2), 1 <= w <= 1000.