You are given 100 stations and distance between each adjacent stations. Now you have to select 10 stations(means 10 hops) among those 100 stations in such a way that maximum of distance between any 2 hops will be minimised. By default 1 and 100 stations are selected , so you need to choose only 8 more stations.
Since you haven't told us:
//Iterate through all possible paths to destination //If you take more than 8 steps, stop and go back //Note the total length of each path //Select the shortest path