📄️ Graph
An adjacency-list graph supporting directed and undirected edges with optional weights.
📄️ Graph BFS
Breadth-first traversal of a graph, visiting all reachable nodes level by level.
📄️ Graph DFS
Depth-first traversal of a graph, exploring as far as possible along each branch before backtracking.
📄️ Dijkstra's Algorithm
Finds the shortest path from a source vertex to a target in a weighted directed graph with non-negative edges.
📄️ Topological Sort
Linear ordering of vertices in a directed acyclic graph (DAG) such that for every edge u → v, u comes before v.