Problem 1615 · Medium

Maximal Network Rank

Find the largest number of roads touching any pair of cities by using degree counts and checking whether the pair is directly connected. The visual highlights the pair and its incident roads.

Open the interactive visualisation