public boolean search(DirectedGraph g, Node start, Node end) {
		//Initialize all the nodes in the graph
		LinkedList<Node> nodes = new LinkedList<Node>();
		for(Node n : g.getNodes()) {
			n.status = Status.Unvisited;
		}
		
		start.status = Status.Visiting;
		nodes.add(start);
		Node node;
		while(!nodes.isEmpty()) {
			node = nodes.removeFirst();
			if(node != null) {
				for(Node q : node.getAdjacent()) {
					if(q.status == Status.Unvisited) {
						if(q == end) {
							return true;
						} else {
							q.status = Status.Visiting;
							nodes.add(q);
						}
					}
				}
				node.status = Status.Visited;
			}
		}
		return false;
	}