Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
difference in approach between DFS and BFS: Connected Components The relation “is connected to” is an equivalence relation: a) reflexive: vertex v is connected to itself b) symmetric: if vertex v is connected to vertex w, then w is connected to v c) transitive: if v connected to w and w connected