Graphs model relationships between entities. Nodes are entities, edges are connections. The two main graph algorithms are BFS (breadth-first search) and DFS (depth-first search). BFS explores level by level. DFS explores as deep as possible before backtracking. In this section, you'll learn to traverse graphs, find connected components, and detect cycles. These patterns solve most graph interview problems.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/graphs/intro
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████