Proceed as in Exercises 1-5, but use the following digraph. Whenever a new vertex to visit must be selected and there is more than one possibility, use the vertex containing the letter that comes earliest in the alphabet.

Depth-first search starting at vertex F.

Exercise 1

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.

Depth-first search starting at vertex 1.

Exercise 1,

Find the adjacency matrix adj and the data matrix data for the given digraph.

Exercise 2,

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.

Depth-first search starting at vertex 2.

Exercise 1,

Find the adjacency matrix adj and the data matrix data for the given digraph.