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:

• Dijkstra’s algorithm

• topological sorting

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 is available at cses.fi/666/list/.

Once you have completed the homework, submit the following form and select the pre-created CSES account assigned to you:

A+ presents the exercise submission form here.

Posting submission...

Identical submission

This submission is identical to the previous submission . Are you sure you want to submit it?

Cancel Submit