Breadth-first Search (BFS) on Graphs Part 2 - Implementation

In this video, you will see how to implement in Java the Breadth-first Search (BFS) algorithm for graphs covered in Part 1. Here's the code for discussed in the video: https://www.dropbox.com/s/23hi7sz6kt7wzf4/Graph.java?dl=0 https://www.dropbox.com/s/o2wh9du3fevk2cv/Queue.java?dl=0 and here are a couple of sample graphs for testing: https://www.dropbox.com/s/xvev9gwdjdef2wq/friendship.txt?dl=0 https://www.dropbox.com/s/oiapo085vp6k3j1/website.txt?dl=0