队列的应用 布线。 解决问题：把布线的区域画成一个网格，该网格用一个二维数组来存储，其中通路用0值表示，墙壁用1值表示，从该区域内的某一点向另一点布线，求布线的最短路径与路径长度。-Application of queue- routing. To solve the problem: to draw regional wiring into a grid, the grid with a two-dimensional array to store the path with a value of 0, represented by 1 walls,　within the region is a point to point wiring, the shortest path and the path length for wiring.