LC 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree (tarjan, 最小生成树) link referenct to @617280219 Sort and group edges by weight. In each step we process one group of edges Discard the edges whose ends are already connected Run Tarjan's bridge finding algorithm on...
Summary: We study in this paper the problem of finding in a graph a subset of $k$ edges whose deletion causes the largest increase in the weight of a minimum spanning tree. We propose for this problem an explicit enumeration algorithm whose complexity, when compared to the current best algor...