Homework before week 6

This week we will start to explore graph algorithms in more depth. In our homework we will cover the following topics:

Homework reading

We will follow Competitive Programmer’s Handbook by Antti Laaksonen. Please read at least the following parts to prepare for week 6:

  • Section 13.2: Dijkstra’s algorithm

  • Section 16.1: Topological sorting

Homework problems

Here you will find a mini-contest with two tasks. Please ask the course staff if you need help!

Use the pre-created CSES homework account assigned to you. Its name will look like aalto26fh_NNN. You will receive the account credentials at a course meeting; do not use a personal CSES account.

The homework contest details and point submission form will be added here soon.

Posting submission...