This method calculates a minimum spanning tree for the network, using Prims algorithm. Result is stored in links as 1's if the link is part of the tree.
By default length is used as cost, but by calling SetFastest or SetCheapest, you can change to another criteria.
Oneway restrictions are not taken into account, neither is limits or the SkipLinkList.
Performance examples:
13,500 links: 0.5 sec
200,000 links: 165 sec
See also SteinerTree for a tree limited to a subset of the nodes.
Syntax: MST(links: TBitArray);
Example output, subset of larger network:
