# Idea: For each node, compute a list of (hub, distance) pairs. The shortest path between any two nodes can be found by checking the common hubs in their labels and taking the minimum sum of distances ...