Dynamo for pipeing?

[saju_autodesk]

@Raouf.Belal, I dont think i still have the video but the discussions continued here, if that helps :

Shortest walk In a network of curves

Thanks @jacob.small and @Vikram_Subbaiah, Finally found a solution that takes all shortest paths and counts the least number bending, Thanks to the Source code of NetworkX package. #Thanks to NetworkX` keys=IN[0] values=IN[1] G = dict(zip(keys,values)) source=IN[2] target=IN[3] path=[] def predecessor(G,source,target=None,cutoff=None,return_seen=None): level=0 # the current level nextlevel=[source] # list of nodes to check at next level se…