Everyone:
Next week, we will work on problems related to graphs and will focus on representing them, traversing them, computing the shortest path in a graph, and forming a minimum spanning tree. Understanding these concepts will be necessary to solve Challenge 16, Challenge 17, and Challenge 18.
The readings for this week are:
Competitive Programmer's Handbook
11. Basics of graphs
12. Graph traversal
13. Shortest paths
15. Spanning Trees
Once you have done the readings, answer the following Reading 06 Quiz questions:
To submit you 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 reading06 # Create reading06 branch and check it out
$ cd reading06 # Go into reading06 folder
$ $EDITOR answers.json # Edit your answers.json file
$ ../.scripts/check.py # Check reading06 quiz
Checking reading06 quiz ...
Q01 0.50
Q02 0.75
Q03 0.50
Q04 0.50
Q05 1.00
Q06 0.75
Score 4.00 / 4.00
Status Success
$ git add answers.json # Add answers.json to staging area
$ git commit -m "Reading 06: Done" # Commit work
$ git push -u origin reading06 # Push branch to github
Once you have commited your work and pushed it to GitHub, remember to create a pull request and assign it to the teaching assistant.