1. Graph Algorithms:

Breadth-First Search (BFS):

• Traverses a graph level by level, useful for finding the shortest path in an unweighted graph. Depth-First Search (DFS):
• Traverses a graph deeply before backtracking, useful for topological sorting and cycle detection.