# Create a Minimum Spanning Tree based on a street network (ArcView)

I hope you can help me with my network analyse problem (ArcGIS 10.0 SP2 - ArcView License)

Background: I try to create a network of fiber optic cables to specific points along a street network.

Here is what I want to do: I want to create a Minimum Spanning Tree based on a street network to give me the shortest path between a couple of fiber optic access points. The MST should start at a fiber optic distribution point and "span out" to the access points.

What I tried so far: I tried to manage it with the Network Analyst and the 'Closest Facility' analysis. The problem is that it handles each connection between a distribution point and a access point as a independent solution (end up in a single route) - so its not the MST. I am not sure if something like that is possible with a geometric network (with sinks and sources) and a flow direction.

Daniel

-
spanning tree tools may work but it may not preserve any line positions you have created, it works with point shapefiles try resources.arcgis.com/gallery/file/geoprocessing/… – Dan Patterson Jul 19 '12 at 10:28
I am working with the Spanning Tree Tools already. The problem is that it is not possible to make the tree follow the road network – oefele Jul 19 '12 at 11:55
I do not understand how you propose to use an MST to produce shortest paths. In some cases it can wind up giving you longest paths! (E.g., any two leaves of the tree might be connected on the network and relatively close, but one would have to track down to a common node in the tree and back up again, which could be quite a detour.) – whuber Jul 19 '12 at 14:44
True. MSP is the tool I use at the moment because I dont know a better solution so far. Any ideas are welcome... – oefele Jul 19 '12 at 15:13
You would be better served, then, by stating your problem rather than asking about how to implement the (apparently imperfect) solution you are currently using! You seem to refer to two distinct problems: that of finding the shortest distance between two points in a network and that of finding all shortest distances from a single (distribution) point. Which problem do you want to solve and what, exactly, would an acceptable solution look like? – whuber Jul 19 '12 at 16:05