public void bfs(int startingNode)
    {
        Queue<Vertex> Q = new LinkedList<Vertex>();
        Q.add(this.getVertex(startingNode));
        this.getVertex(startingNode).setVisited(true);
        this.getVertex(startingNode).setPredecessor(-1);
        while(!Q.isEmpty())
        {
            Vertex v = Q.remove();
            for(AdjListNode a:v.getAdjList())
            {
                Vertex w = this.getVertex(a.getVertexNumber());
                System.out.printf("%s has edge to %s : set %s's pred to %d\n",v.getWord(),w.getWord(),w.getWord(),v.getIndex());
                w.setPredecessor(v.getIndex());
                if(!w.getVisited())
                {
                    w.setVisited(true);
                    Q.add(w);
                }
            }
        }
    }