Next week, we will work on problems related to graphs and will focus on computing minimum spanning trees and topological sorting graphs. Understanding these concepts will be necessary to solve Challenge 17 and Challenge 18.


The readings for this week are:

  1. Competitive Programmer's Handbook

    • 15 Spanning Trees

    • 16 Directed Graphs


Once you have done the readings, answer the following Reading 09 Quiz questions:


To submit you work, follow the same process outlined in Reading 00:

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

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

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

$ ../.scripts/submit.py               # Check reading09 quiz
Submitting reading09 assignment ...
Submitting reading09 quiz ...
     Q01 0.50
     Q02 0.50
     Q03 0.50
     Q04 0.50
   Score 2.00

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

$ git push -u origin reading09        # Push branch to GitLab

Remember to create a merge request and assign the appropriate TA from the Reading 09 TA List.