Graphs: Representations and Traversals

Represent graphs using an adjacency matrix and an adjacency list.

Implement Breadth-First Search (BFS) on a graph to find the shortest path in an unweighted graph.

Implement Depth-First Search (DFS) on a graph, both recursively and iteratively.

Detect a cycle in an undirected graph using BFS or DFS.

Detect a cycle in a directed graph using DFS.

Perform topological sorting on a Directed Acyclic Graph (DAG) using both DFS and Kahn's algorithm (BFS).

Solve problems related to connected components and finding the number of islands.