Class Meeting 9B#

Today we will be discussing a new data structure: Graphs. We are using the slides from Class Meeting 9A, plus the links below.

Topics for today’s lecture#

  • What does it mean to be a “neighbour” in our Voronoi blobification algorithm?

    • Effect of different choices on the meaning of distance.

    • Can we replicate our traditional (Euclidean) meaning of distance?

  • Intro to graphs.

    • Some graph vocabulary.

    • Some examples of graphs.

    • Constructing a template for processing graphs with stacks / queues.

Logistics#

Nothing to clone for today.