Construct a trace table for the algorithm, using the digraph in Exercise of Section. 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 2 to vertex 4.
Exercise ,
Find the adjacency matrix adj and the data matrix data for the given digraph.
