Breadth First Search and Depth First Search are two uninformed search algorithms used for Graph Search.
Link for hand-drawn notes on BFS (best resolution): https://docs.google.com/drawings/d/1Ra111g22Wipx9ujbt7k9v_7vggM9ILuO2YNGvYH-DEs/edit?usp=sharing
Link for hand-drawn notes on DFS (best resolution): https://docs.google.com/drawings/d/1vwvbBZJpQn2Koh3EDVspJc19MLttgXDVsQx4Tm-Zd24/edit?usp=sharing
SOURCE OF DATASET: J. McAuley and J. Leskovec. Learning to Discover Social Circles in Ego Networks. NIPS, 2012.