Not sure about the title of my question... My point is to run an entire workspace for each feature contained in a reader. In python this would look like: for s in bus_stops: run_workspace(s) ...
we have a large contiguous network that will have legitimate overshoots (like a dead end street), but may or may not have illegitimate overshoots. Using FME, I can't seem to manufacture a way to find ...
I may receive maps from any source for my project, and for the C++ algorithm I'm making, it's imperative for the algorithm to know where road junctions (nodes where more than two road segments meet) ...