To continue on with this question. When I run a similar dataset through the topology builder, one of the possible routes is excluded, as it only creates a single from and to node for each edge, where edge A could theoretically have 2 from nodes (B and C).

Hi @Matthew Boyter​ ,

​If you check Generate List from Input Edges parameter in the TopologyBuilder, every node will have a list attribute which contains information of every connected edge. I think you can use the information to find every path through the node.

Hi Takashi,

I am including a zipped extract of my workbench and some sample data in an FFS.

First, I'm starting with a network that ends in a Y-intersection. When it is ran through the topologybuilder, the intersection has 2 nodes.

When ran through the NetworkTopologyCalculator, one leg of the Y is sent to its own network ID, which causes the ShortestPathFinder not to be able to locate it as a viable route.

I've added a testfilter to show 3 different routes, 2 viable routes and 1 route that shouldn't be allowed. Currently, only 1 of the viable routes is being allowed.

I have identified the problem with my dataset that was causing errors in the TopologyBuilder, so now I can route through all possible combinations, but have not resolved the initial problem on how to forbid routes through acute angles.