You are given a graph G with n vertices and m edges, and a minimum spanning tree T of the graph. Suppose one of the edge weights w(e) of the graph is updated. Give an algorithm that runs in time O(m) to test if T still remains the minimum spanning tree of the graph. You may assume that all edge weights are distinct both before and after the update. HINT: If e ∈ T, consider the cut obtained by deleting e from T. If e /∈ T, consider the cycle formed by adding e to T

Iunderstand how you feels bad brother.

What do you mean what does your question mean

That i would call a dead end, since you can't know that it's always possible to immediately reconnect (server could be down, lines between you and the server could be down), and even if it was this would take some time slipping the packages out your wan in the meantime.the solution to this problem rather like satras says to block wan access for those hosts, and if policy routing is being used you need to use the soltion found by fastlanejb in this thread:   the link to the problem forum