Given your needs, I am not sure if you need a minimum spanning tree. You have a central station and consumers and want you want to route from the station to all consumers. Can you be more specific? Is this one route that starts at the station and visits the consumers or is one route per consumer from the station.
If you want to do the first, that is, start at the station and visit the consumers in the best possible way, then the solution is called a travelling salesman problem. You can use the Route solver (in Network Analyst), load you station as the first stop, your consumers as next set of stops and then bring up the route layer properties and on the Analysis tab, Click ON the "Reorder stops to find optimal Route" and un-check the preserve last stop. Solve.
If you need to do the second option, i.e. paths from station to consumers, use the Closest Facility Solver, load your station as the facility and the consumers as incidents and solve. You will get one path per consumer to station. You can set the travel direction from the facility or to the facility as needed.
Jay Sandhu
