Topics:
- Uninformed Search: DFS, DFID, data driven and goal driven, bi-directional search
Uninformed Search
- depth first search
- running time O(b^d)
- space requirements O(b * d)
- may not find the minimum cost solution
- depth first iterative deepening
- running time O(b^d)
- space requirements O(b * d)
- finds the minimum cost solution (shortest path to the goal)
- this algorithm is asymptotically optimal in time-space over all
brute-force shortest path algorithms on a tree
- data driven and goal driven search
- bidirectional search
Search animation (pointer thanks to Pamela Smith)
Switch to:
vasilis@cis.temple.edu