基于XML-Tree的单源最短路径改进算法及快速仿真  

Improvement and Quick Simulation of Single-Source Shortest Path Algorithm Based on XML-Tree

作　　者：戴莉萍[1] 黄龙军[1] 

机构地区：[1]江西师范大学软件学院,南昌330022

出　　处：《计算机系统应用》2015年第11期190-194,共5页Computer Systems & Applications

基　　金：江西省高校教改课题(JXJG-14-2-20)

摘　　要：单源最短路径问题是图论中的一个基础课题.结合图与树在数据结构表示上的相似性及易转换性,基于XML技术提出了一种改进的单源最短路径算法.该算法利用XML结构,按照任意树的生成顺序组织成一棵树;而后对树中的每条边做判断,不断调整当前各个节点到源点之间的最短距离.使用基本控件快速实现该算法的仿真过程,实验结果表明,该算法具有较好的时间效率,灵活性较强、简单易懂及较好的应用价值.Single-source shortest path problem is one of basic researches in graphic theory. Considering the similarity and easy transferability of data structure between graphic and tree, an improved algorithm solving this problem is put forward based on the technology of XML. Using XML structure, this algorithm transfers a graphic to some tree, and analyzes each edge in this tree to adjust the best distance between other vertices and the source vertex. With basic controls used in the execution of this algorithm to simulated the process, and experimental results show that this new algorithm is much more efficient, and more flexible, and easy to understand and good to practical applications.

关 键 词：单源最短路径 XML树型结构 TREEVIEW控件 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]