Reading 13: Graphs (Traversals)

Everyone:

Next week, we will continue exploring graphs, with a focus on traversal algorithms such as depth first search and breadth first search, and other graph algorithms such as Dijkstra's and Prim's, which build off these traversal algorithms to solve problems such as finding the shortest path between two vertices or determining the minimum spanning tree of a graph.

TL;DR

The focus of this reading is depth first search, breadth first search, Dijkstra's algorithm, and Prim's algorithm.

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 13 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 reading13           # Create reading13 branch and check it out

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

$ ../.scripts/check.py                # Check reading13 quiz
Checking reading13 quiz ...
      Q1 0.80
      Q2 0.40
      Q3 0.40
      Q4 0.40
      Q5 0.40
      Q6 0.60
   Score 3.00 / 3.00
  Status Success

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

$ git push -u origin reading13        # 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 13 TA List.