Lee’s algorithm uses breadth-first. The cost function in the search is the distance of a labeled grid from the source.
For more information about Maze Routing and other forms of routing, see a VLSI CAD textbook such as M. Sarrafzadeh and C. K. Wong, An Introduction to VLSI Design, McGraw-Hill, 1996.