public void breadthFirst() {
        int start = 0;
        int end = 0;

        graph[0].setIdentified();
        queue[end] = graph[0];
        end++;
        while (start != end) {
            Node u = queue[start];
            start++;
            for (int i = 0; i < size; i++) {
                Node v = u.getNode(i);
                if (v != null && !v.identified() && !v.visited()) {
                    v.setIdentified();
                    queue[end] = v;
                    end++;
                }
            }
            u.setVisited();
        }
        for (int i = 0; i < size; i++) {
            if (queue[i] != null) {
                System.out.println(queue[i].getItem());
            }
        }
    }