• Shortest Path: Using BFS, Dijkstra’s Algorithm, Bellman-Ford, etc.
• Cycle Detection: Using DFS.
• Connected Components: Find the number of connected components in an undirected graph using DFS or BFS.
• Topological Sorting: Used in Directed Acyclic Graphs (DAG) to sort vertices linearly.