BFS: Shortest Reach in a Graph | HackerRank
Implement a Breadth First Search (BFS).
www.hackerrank.com