Introduction
The very basics
Infinite looping
Processing trees with recursive CTEs
Processing graphs with recursive ctes
32. Traveling salesman – exercise 2
Summary

## Instruction

That's it! One more exercise based on that example.

## Exercise

Bristol turned out to be a horrible location – it was too far away from London. Instead, the management decided to split the headquarters into three smaller offices: one in London, and the other two in two other cities.

Produce paths starting in London as before, but they should now consist of only 3 cities: London and the two other cities. Sort the paths by descending order based on TotalDistance so that the management can decide where to place the offices.

### Stuck? Here's a hint!

You only need to modify the outer query a bit!