中文摘要：

全局最短路径是组合优化的经典问题之一。求解最小Steiner树的可视化试验成功的在给定节点中间生成了Steiner点，但当给定节点数目增多且呈不规则分布时，试验方法形成薄膜路径困难并且不稳定。针对试验的不足，文中构建了Exp-Geo算法。在给定点数目增多时，采用该算法能够在给定节点之间生成Steiner点，得到全局最短路径，弥补试验的不足。经过多次试验、计算、对比分析，证明该算法能在多点系统中找到系统全局最短路径，为可视化试验的推广奠定了基础。

英文摘要：

Global shortest path is a classic problem combinatorial optimization. The visualization approach to solving the Steiner minimum tree succeeds in automatically generating Steiner points. However, the forming of membrane is difficult and the results is not stable when the given nodes in crease and are in irregular distribution. For the insufficient experiment of visualization approach Exp-Geo algorithm is constructed. The Exp-Geo algorithm could generate steiner points among the given points and the global shortest path is obtained, when the given nodes increase, thus making up the insufficiency of experiment method. Numerous calculations,experiments and comparisons indicate thatExp-Geo algorithm could find the system global shortest path in the multi-node system, thus laying a foundation for the popularization of visualization experiment.