On the distribution of typical shortest-path lengths in connected random geometric graphs