BFS implemented with LinkedList as queue
Unvisit all edges before performing BFS or DFS
Method for creating a simple graph similar to an Erdos-Renyi algorithm for graph creation: vertices and probablity of creating an edge
BFS tested
Merge pull request #37 from dpflann/dsa

BFS