Rewrite the depthFirstPrint method from Figure 14.4 so that it carries out a breadth-first search instead.

FIGURE 14.4 Depth-First Search Implementations public static void depthFirstRecurse (Graph g, int v, boolean[ ] marked) { int[ ] connections = g.neighbors(v); int i; marked [v] = true; System.out.println(g.getLabel(v)); // Traverse all the neighbors, looking for unmarked vertices: for (int nextNeighbor : connections) { if (!marked [nextNeighbor]) depthFirstRecurse(g, nextNeighbor, marked); } public static void depthFirstPrint(Graph g, int start) { boolean[ ] marked = new boolean [g.size( )]; depthFirstRecurse (g, start, marked); }