Construct a trace table for the algorithm, using the digraph in Exercise 1 of Section 16.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.

Breadth-first search starting at vertex 2.

Exercise 1,

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

Exercise 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.

Shortest path from vertex A to vertex E.

Exercise 1,

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