Gabriel Basilio GabrielBB

I like to think I know how to code

gennad / BFSDFS.java

Created January 23, 2011 09:14

Breadth-first search and depth-first search Java implementation

	Class Main {
	public void bfs()
	{
	// BFS uses Queue data structure
	Queue queue = new LinkedList();
	queue.add(this.rootNode);
	printNode(this.rootNode);
	rootNode.visited = true;
	while(!queue.isEmpty()) {
	Node node = (Node)queue.remove();