Skip to main content
  • EN

Hello , 

I would like to understand more about shortest path finder

i know ,it requires start and end node  

As picture :

I have start point and end point ,several lines .

i need it  (start from right of picture (start point) to left crossing all lines ,not only from start to end ,continue to the lines of square area  and force the lines to order the direction from right to left 

Is there a good idea here to let the fme set the direction from right to left and implement it for all lines (lines crossing from start to end and also the lines of square area till end )

 

 

Hi @gogopotter90 I think you’re wanting a path that includes every edge at least once? The ShortestPathFinder doesn’t really do that, but you could get that in this simple case by creating a From-To line that includes every vertex that the path should pass through.  The intermediate points don’t need to be ordered before the ShortestPathFinder in this case, but if the network is more complex then there’s no way to guarantee that the shortest path will include all edges.  In other words, the only way currently to guarantee that all edges will be in the path is to have vertices ordered in the From-To line.

FYI the related issue is FMEENGINE-74405

I got what u explained .thanks for the explanation . 

 

Reply


Community Stats

30,351
Posts
115,342
Replies
38,082
Members
Terms & ConditionsCookie settings
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.