Abstract: This paper describes the minimum cost router,which is the improved Lee's algorithm.We define the cost function.Point s and point t are giyen in the grid graph G.We want to find a minimum cost path between s and t.It takes less time to find the path by the minimum cost router than by Lee's algorithm.It is convenient to control routing.The minimum cost router is coded in FORTRAN and implemented on M 68000 computer.