CS350: Data Structures Class Notes
Week 11, Class 30: Monday, November 10, 2008
Today we went over the homework from last time. (As pointed out, rotating a heap tree
doesn’t make much sense. It is already balanced and rotation destroys it intrinsic
properties.)
We went over the sorting project. Points to remember: Best-case data is the data an
algorithm runs fastest on. That may be sorted or it may be some other organization. You
should show the relationship between actual data measurements and your description of
the complexity. You should have as large a range of sample sizes, 10, 100, 1000, 10,000,
100,000, … , as feasible.
Today we introduced graphs and graph representations.
Vocabulary: vertex/node, edge, directed/undirected graphs, weighted/unweighted, simple,
connected, fully connected, path, cycle, acyclic
Representations: Set theoretic, adjacency matrix, adjacency list
Homework for Wednesday: P279 1 & 2