Today's activities were packed. They compared directed and undirected graphs, representations using adjacency matrix and adjacency lists, run-time and memory use, and sparse vs. dense graphs. We hope that in addition, you develop skills in representing a given situation as a graph, that is, identifying the vertices in the situation and describing for each two vertices whether or not they are related.
Homework Submission