This paper develops a heuristic procedure for finding the maximum increment and decrement of each edge weight separately without modifying the optimality of minimum spanning tree. The procedure of the proposed approach is illustrated by numerical example. © 2018, Springer Nature Switzerland AG.