Abstract: A new algorithm for two-terminal net routing is presented,which is based on ant colonies system.For a given routing plane,a strong connection graph with shortest path information is constructed as a parameter to select the right search direction,and an initialization odor matrix is constructed.The algorithm is used to search target path and will find out the shortest routing path only if it exists.