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.
- For homework, submit
MyWikiGraph.javaand the picture of the graph you get after exploring different article titles. Submit them as
hw18. Note: The submit script will not automatically add your image; thus, you should select it when prompted.
- There is no homework for the next lab, so we are giving you extra time to finish this homework assignment. It will be due as if it were assigned on Monday (due before lab on Tuesday).