Hello,
In the app I am writing I need to be able to work out the critical path for a graph. I have looked at the function PathFinder.FindLongestPath and have a couple of questions about it. Unlike FindShortest path there don't seem to be arguments to include node weight (which is what I would need) does this function automatically find the longest path with node weight and link weight considered, or does it simply return the  path with the most links in it.  Thank you for any help.
Rich.