In this paper we describe a crosstalk aware router, which can be applied to special net routing, such as clock, and other timing critical nets. The router uses a new data structure called constrained region graph which represents the necessary information. We developed a novel algorithm to solve the minimal crosstalk routing problem. We also prove that given a layout, and a two-pin connection of a critical net to be laid out, our algorithm can always obtain the optimal solution.