Lecture 36
Learning objectives
After this class, you should be able to:
- Define a graph (undirected and directed), a vertex/node, and an edge.
- Given the figure of a graph, give its set of vertices and set of edges.
- Given the set of vertices and set of edges of a graph, draw a figure to show the graph.
- Given a graph, show its representations using an adjacency list and adjacency matrix. Also give the space required for each of those representations.
- Given a DAG, show the steps in topologically sorting the vertices, and give the time complexity of the algorithm.
Reading assignment
- Chapter 10, sections 9.1, 9.2.
- Lecture: Graphs.
Exercises and review questions
- Exercises and review questions on current lecture's material
- Give the adjacency list and adjacency matrix for the graph in figure 9.79, if the edges were undirected.
- Topologically sort the DAG in figure 9.79.
- Questions on next lecture's material
- Start preparing for the final exam. Look at the finals review and come prepared to seek clarifications on the final exam.
Last modified: 1 Dec 2011