Challenge: Minimum Spanning Trees

Explore how to update a minimum spanning tree when the weight of an edge decreases. Learn to implement an algorithm that finds the heaviest edge on the path between two nodes using depth-first search, then updates the tree structure efficiently in Python.