A Steiner-Tree is similar to a minimum spanning tree, with the exception you can select which nodes in the network you want to connect.
We are using an approximation to solve the problem.
See also MST for an explanation.
Nodes parameter is the input, a list of nodes, while links is the output containing true for links that should be included.
Oneway restrictions are ignored, since a tree has no sense of direction. If you want to avoid certains links in the calculation, use SetSkipLinkList instead.
Syntax: SteinerTree(nodes: TIntegerList; links: TBitArray);
