Abstract
In Artificial Intelligence, the graph search algorithms are widely used for problems such as finding the shortest path in a graph and searching for the best strategy.
It's a multi-part series in which I am planning to cover the following:
- What is graph search algorithm
- Graphs and Trees
- Branching Factor
- Complete and Optimal
- What is breadth-first search
- The property of breadth-first search
- What is depth-first search
- The property of depth-first search
- What is uniform-cost search
- The property of uniform-cost search
- What is depth-limited search
- The property of uniform-cost search
- What is iterative deepening search
- The property of iterative deepening search
- What is bidirectional search
- The property of bidirectional search