A　breadth-first　search　(BFS)　algorithm　usually　needs　less　time　but　consumes　more　computer　memory　space　than　a　depth-first　search　(DFS)　algorithm　to　find　the　shortest　path　between　two　nodes.　This　paper　attempts　to　combine　BFS　with　DFS　algorithms　to　find　all　shortest　paths　in　the　VLSI　(Very　Large　Integration　Circuits)　wire　routing.　BFS　is　used　to　compute　the　shortest　distance　between　every　position　and　the　start　one.　DFS　is　used　to　traverse　all　shortest　paths　in　the　course　of　backtracking　from　the　end　position　to　the　start　one.　The　effectiveness　of　the　method　is　proved　by　the　theoretical　analysis　and　the　experiment　results.　©　2010　IEEE.