ADTs, Data Structures, and Problem Solving with C++ 2nd Edition by Larry Nyhoff

Exercise 4

For Exercises 1-5, construct a trace table for the algorithm, using the digraph in Exercise 1 of Section 16.1. Whenever a new vertex to visit must be selected and there is more than one possibility, use the vertex labeled with the smallest number.
Breadth-first search starting at vertex 2.