Everyone:
Next week, we will work on more problems related to graphs and will focus on topological sort, hamiltonian paths, and min-flow/max-cut problems. Understanding these concepts will be necessary to solve Challenge 19, Challenge 20, and Challenge 21.
The readings for this week are:
Competitive Programmer's Handbook
16 Directed Graphs
19 Paths and circuits
20 Flows and cuts
Once you have done the readings, answer the following Reading 07 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 reading07 # Create reading07 branch and check it out
$ cd reading07 # Go into reading07 folder
$ $EDITOR answers.json # Edit your answers.json file
$ ../.scripts/check.py # Check reading07 quiz
Checking reading07 quiz ...
Q01 0.75
Q02 0.75
Q03 0.60
Q04 0.20
Q05 0.30
Q06 0.20
Q07 0.75
Q08 0.45
Score 4.00 / 4.00
Status Success
$ git add answers.json # Add answers.json to staging area
$ git commit -m "Reading 07: Done" # Commit work
$ git push -u origin reading07 # 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.