We have added a new method for Steiner Tree’s, which deals with the problem of connecting points on a network with the shortest possible set of links, so there is a path between all points. Like when you install pipelines along roads for various purposes.
Finding the optimum solution is an NP-complete problem, so our algorithm only finds an approximation – although a good one. If you inspect the sample below closely, you will also see that it had been slightly more efficient if node 7 rather than node 20 had been connected to the line between 6 and 16.
