Unformatted text preview: N O( b m ) O( bm ) Y N* O( b s+1 ) O( b s+1 ) Y N* O( b s ) O( bs ) … b Costs on Actions Notice that BFS finds the shortest path in terms of number of transitions. It does not find the least-cost path. We will quickly cover an algorithm which does find the least-cost path. START GOAL d b p q c e h a f r 2 9 2 8 1 8 2 3 1 4 4 15 1 3 2 2...
View Full Document
- Spring '08
- Shortest path problem, Algorithm DFS BFS, Iterative deepening uses