Reading 12: Graphs (Representation)

Everyone:

Next week, we will transition from binary trees to graphs, with a focus on how to represent them using adjacency matrices and adjacency lists.

TL;DR

The focus of this reading is graphs, adjacency matrices, and adjacency lists.

Readings

The readings for this week are:

  1. Data Structures Handbook

  2. Learn DS & Algorithms

Quiz

Once you have completed the readings, answer the following Reading 12 Quiz questions:

Submission

To submit your work, follow the same process outlined in Reading 01:

$ git checkout master                 # Make sure we are in master branch
$ git pull --rebase                   # Make sure we are up-to-date with GitHub

$ git checkout -b reading12           # Create reading12 branch and check it out

$ cd reading12                        # Go into reading12 folder
$ $EDITOR answers.json                # Edit your answers.json file

$ ../.scripts/check.py                # Check reading12 quiz
Checking reading12 quiz ...
      Q1 1.00
      Q2 1.00
      Q3 0.50
      Q4 0.50
   Score 3.00 / 3.00
  Status Success

$ git add answers.json                # Add answers.json to staging area
$ git commit -m "Reading 12: Done"    # Commit work

$ git push -u origin reading12        # Push branch to GitHub

Pull Request

Once you have committed your work and pushed it to GitHub, remember to create a pull request and assign it to the appropriate teaching assistant from the Reading 12 TA List.