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 part to prepare for week 6:

Section 13.2: Dijkstra’s algorithm
Section 16.1: Topological sorting

Homework problems¶

You will find here a mini-contest with two tasks: cses.fi/465/list/. Please ask in Zulip if you need help!

To complete the homework, solve these tasks before the contest closes. Please use your own personal CSES account. Once you have completed the homework contest, please submit the following form:

A+ presents the exercise submission form here.