Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.