Meeting Agenda

1. Settle down whether to use adjacency list or adjacency matrix
2. Writing the constructor
3. Implementing basic graph operations
4. Finding a weighted shortest path
5. Finding the smallest connecting threshold

Unfinished Business

Last meeting, we didn't settle down on whether we should use adjacency matrix or adjacency list to represent a graph. Today's first goal is to choose between these two.

• adjacency matrix
  • data structure: 2D array
• adjacency list
  • data structure: unordered map

👆Adjacency list representation

👆Adjacency matrix representation

New Business

Besides finishing what we've left from the last meeting, we need to start working on the constructor after we've decided which data structure to use.
Then, we need to finish the methods about the basic graph properties.
After this, we need to tackle down the two most complicated methods: finding a weighted shortest path using BFS and the smallest connecting threshold. This is going to be a lot of work. Thus, carpe diem!

Concerns or Comments

Thanks for attending the meeting!

Here is the firework show from Disney!

Don't be frightened by all of this work. Listen to this fight song at the bottom right to cheer you up!