🔥 breadth first search → Breadth-first search is a concrete traversal method that applies the traversal paradigm using a queue and visited tracking to explore vertices level-by-level; it depends on traversal fundamentals for correctness and complexity reasoning.

🔥 depth first search → Depth-first search builds on the general concept of graph traversal: it relies on systematic visiting of vertices and edges, visited-set management, adjacency iteration, and complexity reasoning established by traversal.

🌟 connected component →

🌟 cycle detection →

🌟 topological sort →

⚡️ directed acyclic graph →

⚡️ shortest path →

⚡️ bipartite check →