CS210 Tutorial 14

Complete the following exercises pasted below:

Q1. Draw the directed graph that corresponds to this adjacency matrix:

Q2. Draw the edge list that correspond to the graph from the previous question.

Q3. Given the following graph, in what order are the vertices visited for a depth-first search that starts at 0? In what order are the vertices visited for a breadth-first search that starts at 0?

Q4. Show the adjacency list of the graph given in the previous question.

Q5. Consider the highest weighted edge for choosing the next vertex; do a DFS on this graph starting at 7

Q6. Show the result of Breadth First Search on the above directed weighted graph.Consider the lowest weighted edge for choosing the next vertex. Start at 1.