Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
Recognize the pattern
Brute force idea
A straightforward first read of Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree is this: For each edge, compute MST without it and with it forced in. Two MST computations per edge. That instinct is useful because it follows the prompt literally, but it usually keeps revisiting work the problem is begging you to organize.
Better approach
A calmer way to see Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree is this: Compute the base MST weight. For each edge: (1) exclude it and compute MST — if weight increases or MST is disconnected, it's critical. (2) Force-include it and compute MST — if weight equals base, it's pseudo-critical. but with Kruskal's, each MST is fast. The goal is not to be clever for its own sake, but to remember the one relationship that keeps the solution grounded as you move forward.
Key invariant
The truth you want to protect throughout Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree is this: A critical edge must be in every MST. A pseudo-critical edge appears in at least one MST but not all. Testing exclusion catches critical edges; testing forced inclusion catches pseudo-critical ones. If that remains true after every update, the rest of the reasoning has a stable place to stand.
Watch out for
A common way to get lost in Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree is this: Not testing both exclusion AND forced inclusion — an edge could be neither critical nor pseudo-critical. Also, a disconnected graph after exclusion means the edge was a bridge, making it critical. Most mistakes here are not about syntax; they come from losing track of what your state, pointer, or structure is supposed to mean.