Hey, I want to find the best path out of multiple target points, so say I have A,B,C,D,E points that I need to go but I want to find the best path to follow that is the shortest so I go to all of them. Do I just calculate all permutations and find the path with the smallest needed distance? Also can I use this somehow in a custom made array?