The document discusses various search algorithms including Breadth First Search (BFS), Depth First Search (DFS), and A* search. It mentions using BFS for finding the shortest path from the source 'Arad' to the goal 'Bucharest'. Additionally, the document includes code snippets for these algorithms.

1. Breadth
First Search
(BFS)
Shortest path first search
Eng/mahana M Elbana

2. Source "Arad" and Goal "Bucharest"

3. code

4. Depth First
Search (DFS)
longest path first search

5. code

6. A* Search
(The best estimated total
path cost first)

7. code

8. Tank you