In the example of Count Graph(https://www.codechef.com/LTIME87A/problems/CNTGRP)

In case 1

If we connect each node to 1st node we can get one more graph

Shortest distance to 3 will become 1, if I understood you correctly.

Are they saying distance between two directly connected node is 1