A　breadth-first　search　(BFS)　algorithm　can　usually　find　one　shortest　path　rather　than　traverse　all　possible　ones　in　the　very　large　scale　integration　(VLSI)　wire　routing.　To　achieve　the　purpose　of　the　latter,　this　paper　attempts　to　improve　the　BFS　algorithm　for　VLSI　wire　routing　by　introducing　a　method　of　linear　indexing.　This　method　guarantees　to　find　all　the　existing　shortest　paths　with　the　same　length　in　the　VLSI　wire　routing　to　provide　the　wire　routing　designers　more　alternatives　for　best　designs.