Notes on using Breadth-First Search (BFS) for traversing a graph.
Notes on the "Disjoint Set" data structure.