Geometry-Experiment Algorithm for Steiner Minimal Tree Problem

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="367107.fig.002a" src="https://static.hindawi.com/articles/jam/volume-2013/367107/figures/367107.fig.002a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Schematic diagram</td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="367107.fig.002b" src="https://static.hindawi.com/articles/jam/volume-2013/367107/figures/367107.fig.002b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Instrument image</td></tr></table></td></tr></table>

<table>The shortest path experiment device.</table>

Journal of Applied Mathematics

fig2

Figure 2

Figure 2: Geometry-Experiment Algorithm for Steiner Minimal Tree Problem 