Maze router without a grid map

It is pointed out that maze routers provide powerful and flexible routing algorithms, but require storage of information for every routing grid and layer. The number of these grids is often so large that routing programs either run out of memory or become very slow due to excessive paging. A data organization which, with certain modifications to the algorithm, reduces and possibly eliminates the entire grid map is presented. The router has been coded with a special data structure library.<>