Or is there a better way? In our network I wrote an algorithm to find the common ancestors of our service points... but what we are interested in is the CLOSEST (or first) common anscestor which is a hypothetical first point of failure. It really surprised me that the results have edges and junctions seperated out in no logical order. I found a way to order them, I run through every single junction and do an upstream trace, then count the results for each junction. The junction that has the MOST results is the one farthest from the source and the FIRST common ansestor, but as you can imagine, running through 20 traces each time is pretty time consuming and resource intesive.
Is there any other way?
Thanks!
Brandon
