This document discusses algorithms for finding shortest paths and traversing connected graphs. It covers breadth-first search and depth-first search algorithms, which are used to traverse graphs in different ways. Breadth-first search prioritizes exploring nodes closest to the starting node, while depth-first search explores nodes as far as possible along each branch before backtracking. The document also presents a generic graph traversal algorithm that can be adapted for either search approach.

1. Algorithms

2. Shortest Path

3. Shortest Path

4. Shortest Path

5. Shortest Path

6. Breadth-first Search

7. Breadth-first Search

8. Breadth-first Search

9. Traversing Connected Graphs

10. Depth-first Search

11. Depth-first Search

12. Traversing Connected Graphs

13. Generic Graph Traversal Algorithm

14. Traversing Connected Graphs

15. Traversing Connected Graphs

16. Generic Graph Traversal Algorithm

17. Generic Graph Traversal Algorithm

18. Generic Graph Traversal Algorithm

19. Breadth-first Search

20. Breadth-first Search

21. Breadth-first Search

22. Breadth-first Search

23. GRAPHS

24. Depth-first Search

25. Breadth-first Search