Hey Aron,
I´m using a GridGraph and ProVersion 3.7.3
i´m trying to calculate a path to another path(mainpath), finding the shortest connection. Therefore i want to iterate over the mainpath, looking for nodes with more then 2 connections (since they will be the only relevant nodes to enter) and make an isPathPossible check. so far everything is working, i get a bunch of possible nodes to enter the mainpath.
Now i need to find out wich of those paths is the shortest. Do i need to Calculate those paths (seeker.StartPath) to find out their length, or is it possible to get the length of the found connection from isPathPossible?
Thanks for your support
Marcus