Skip to main content

I hope I can explain this in a way that makes sense.

I'm working on a fibre network where the main cable(s) leave the 'network hub' and connect to a building at the end of each respective route (see below, network hub = yellow, building = red). The goal is to number every node (ascending) from the end of a branch, working backwards towards the network hub (fibre allocation). What I'm hoping will work is creating a virtual merged line (for every building node) that contains the merged cables along the route back to the Network hub. Once this is achieved, I'm pretty sure I can handle the numbering of the nodes along the way, but even after hours of research I haven't been able to trace the route back from any given node, and merge all cables along the way. Has anyone worked on something similar in the past? Any help at all would be greatly appreciated. Blue below would be an example of one virtual merged line. Thank you in advance.image

Have you tried the ShortestPathFinder? Input your network and from/to pair, and it should return the cables that goes between them.

To trace multiple from/to you need to use the group by, which might take a bit of computing.

 

For the numbering though, how would you handle additional building connections in future, if they need to be in ascending order?


Reply