We present an algorithm to find near-optimal weighted Steiner minimal trees in the plane. The algorithm is implemented in Evolver programming language, which already contains many built-in energy minimisation routines. Some are invoked in the program, which enable it to consist of only 183 lines of source code. Our algorithm reproduces the physical experiment of a soap film detaching from connected pins towards a stable configuration. In the non-weighted case comparisons with GeoSteiner are drawn for terminals that form a pattern.

中文翻译：

---

加权 Steiner 树的 Evolver 程序

我们提出了一种算法来在平面中找到接近最优的加权 Steiner 最小树。该算法是用 Evolver 编程语言实现的，该语言已经包含许多内置的能量最小化例程。有些是在程序中调用的，这使其仅包含 183 行源代码。我们的算法重现了肥皂膜从连接的针脚上分离到稳定配置的物理实验。在非加权情况下，与 GeoSteiner 的比较是针对形成模式的终端绘制的。