As the short path finder requires FROM.TO. input with line terwork.
I have a data that has 680(From) and 1882(TO). So the From To table will be 1,279,760 record which takes too much time. For analysis.
.
My data extent is 1500m*4000m.
The farthest From To path in my data never exceed 300m.
My idea is to create a table using neiblghbour finder to search for all( From) point to TO points with a tolerance 300. OR within a boundary.
Or something like excluding the To found with minimum distance shirt path finder found.
Is this valid?
I'm trying to minimize the matrix created by FME to reduce the process for short path finder.
Any help or ideas.?