🔥 breadth first search → Provides per-vertex neighbor lists so BFS can iterate neighbors in O(deg(v)), achieving O(V+E) traversal; using an adjacency matrix would degrade to O(V^2) scans.

🔥 minimum spanning tree → Minimum spanning tree algorithms commonly use adjacency lists to iterate neighbors/edges efficiently on sparse graphs, enabling Prim’s O(E log V) with a heap and straightforward edge enumeration for Kruskal.

🔥 depth first search → Depth-first search implementations typically store graphs as adjacency lists to iterate neighbors efficiently, enabling O(V+E) traversal by visiting each vertex’s list in O(degree) time.

⭐️ topological sort →

⚡️ dijkstra algorithm →

⚡️ weighted graph →

⚡️ graph traversal →

⚡️ topological sort →