Routing without circuits (minimum spanning tree)

Discussion created by martin_1 on May 19, 2010
Latest reply on May 20, 2010 by jsandhu-esristaff

my question is, how can I do a routing WITHOUT circuits/ circles? Like a minimum spanning tree.

I have a network with edges and junctions (based on streets). And the edges have a length attribute. And now I want to add a central station (junction) and some consumers (junctions) along this network. Then I want to route from the central station to all consumers in the shortest way, BUT the routing is not allowed to have any circuits!

Thank you very much in advance.