Graph Algorithms

Represent graphs using adjacency lists and matrices, and analyze their space-time trade-offs.

Implement Breadth-First Search (BFS) for shortest path in unweighted graphs.

Implement Depth-First Search (DFS) recursively and iteratively for traversal and cycle detection.

Perform a topological sort on a Directed Acyclic Graph (DAG).

Implement Dijkstra's algorithm for single-source shortest paths in weighted graphs with non-negative edges.

Implement the Bellman-Ford algorithm to handle graphs with negative edge weights.

Implement Kruskal's and Prim's algorithms to find a Minimum Spanning Tree (MST) in a graph.