Hopefully I understand your last question correctly, so, once you have all of the potential paths identified, then, you need to determine their length by summing the individual connector lengths along that path. I think the easiest was is to create a running sum as each path is traveled. Then, perhaps this is saved in an array, or you have two totals, the length of the current path and the 2nd would be the shortest of the previous path. You might do something like store the previous path, perhaps highlight it by color change, or write it into Excel. By default, the 1st path is automatically stored. Then go thru the 2nd path, if it's total length is shorter than previous path, it becomes the path stored, and move on to next path. By end of the process, the shortest path will be stored and highlighted.