I haven't seen the code yet, but looks like that will only get the optimum if you allow the algorithm gets also the edges where neither u or v are in EV...
Interesting read. I've implemented basically this algorithm in Dark Basic Pro. This code snippet creates a random set of "nodes" (or cities in this case) with non-overlapping eges (Connections in this case)...