Thanks to spanning tree protocol, switched network environments are capable of connecting bridges and switches with multiple paths for data transmission.

The Esau-Williams algorithm is one of the best known heuristics for the capacitated minimum spanning tree problem. This paper describes a simple enhancement of this heuristic. On benchmark test ...