Leetcode 1615. Maximal Network Rank

Given an undirected graph of n cities and roads, compute the maximum over all unordered city pairs of the total number of roads incident to either city, counting a shared road only once. This is equivalent to taking the sum of their degrees and subtracting one if the two cities are directly connected.