笔者:YY同学
文章目录
Uninformed Search Methods
1. Breadth First Search (BFS)
2. Depth First Search (DFS)
3. Iterative Deepening Algorithm (IDA)
4. Bi-directional Search (BDS)
5. Uniform Cost Search (UCS)
Informed (Heuristic) Search Methods
1. Best First Search
2. Greedy Search (GS)
3. A *
4. IDA*
Chart
Algorithm | Completeness | Optimality | Time Complexity | Memory Complexity |
---|---|---|---|---|
BFS | Yes | Yes | O(b^d) | O(b^d) |
DFS | No | No | O(b^m) | O(mb) |
IDA | Yes | Yes | O(b^d) | O(db) |
BDS | Yes | Yes | O(b^(d/2)) | O(b^(d/2)) |
UCS | Yes | Yes | O(b^(g*/ε)) | O(b^(g*/ε)) |
GS | Yes | No | > O(b^m) | > O(b^m) |
A* | Yes | Yes | < O(b^(g*)) | < O(b^(g*)) |
IDA* | Yes | Yes | < O(b^(g*)) | < O(b^(g*)) |