Use the following graph for this problem.    a) Write out b…

Use the following graph for this problem.    a) Write out both the adjacency matrix and adjacency list representations of this graph. Be sure to specify which is which.   b) Show the topological order after running the DFS-based algorithm, and showing the discovering time and finishing time for each node.   c) Run breadth-first search on the graph, starting from vertex 2. List the vertices in the order in which they are dequeued from the FIFO queue.

Our CHEM 9 course syllabus serves as a “contract” between yo…

Our CHEM 9 course syllabus serves as a “contract” between you (the student) and I (Alvin Kung). If, for any reason, you disagree with any part of this contract and refuse to abide by it, this course may not be suitable for you at this time. You need to express your comments in writing and submit them to the Chemistry Department chair or me as early as the first week of the semester with the intention of resolving any outstanding issues. By signing here, you agree to all the terms of this syllabus and the Policy on the Recording of Lectures and Teaching Sessions.    Please sign this agreement by typing in your first and last name.