In this paper, we propose a new methodology to integrate circuit transformation into routing. More specifically, this paper shows an approach for performing routing and wire reconnection simultaneously. To accomplish this, we introduce a new logic representation that implements all possible wire reconnections implicitly by enhancing global flow optimization techniques. Since our method takes into account circuit transformation during routing phase where the accurate physical information is available, we can obtain better results than the conventional routing algorithms. In addition, we can succeed in routing even if other routers like rip-up and reroute methods fail. The algorithm has been implemented and the experimental results are presented. We believe this is the first approach which combines them completely.