Debrief

The two problems that were not what they looked like, and what is left in the course.

Quick check· 5 min

Counting across components

A graph has components of sizes 3, 2, and 1, so six nodes in total. How many pairs of nodes sit in different components?

111569

Select all that apply· 5 min

Which of these need a heap?

Select every situation where a plain queue is not sufficient and a heap is required.

Cheapest route where edges have different non-negative costsRoute minimizing the largest single edge along itFewest steps in a grid where every move costs oneConnecting every node at the least total edge costDistance to the nearest of several equally valid starting cells

Checkpoint: recursion and graphs

124 / 170

Checkpoint: recursion and graphsLesson 3 of 3About 19 min

Debrief

The two problems that were not what they looked like, and what is left in the course.

Quick check· 5 min

Counting across components

A graph has components of sizes 3, 2, and 1, so six nodes in total. How many pairs of nodes sit in different components?

111569

Select all that apply· 5 min

Which of these need a heap?

Select every situation where a plain queue is not sufficient and a heap is required.