Breadth-First Search

Finding the Shortest Path from Source to other Nodes

Finding Shortest Path from Source in a 2D graph

Connected Components Of Undirected Graph Using BFS.