| 基于STL的图遍历问题的解决 |
| |
| 引用本文： | 炎士涛,郭晓娟,王全蕊.基于STL的图遍历问题的解决[J].新乡学院学报(自然科学版),2009,26(1):50-51. |
| |
| 作者姓名： | 炎士涛 郭晓娟 王全蕊 |
| |
| 作者单位： | 河南科技学院,信息工程学院,河南,新乡,453000 |
| |
| 摘 要： | 讨论了对图的遍历问题的解决方法，解决图的遍历问题的最终目的在于通过遍历得到点之间的最短距离，这就需要对遍历中经过的节点权值进行比较，遍历所有途径得到最优结果。
|
| 关 键 词： | 广度优先搜索 深度优先搜索 STL |
Solving Problem of Traversing Graph Based on STL |
| |
| Authors: | YAN Shi-tao GUO Xiao-juan WANG Quan-rui |
| |
| Institution: | (College of Information Engineering, Henan Institute of Science and Technology, Xinxiang 453000, China) |
| |
| Abstract: | The discussion on the issue of the traversing graph settlement is designed to get the shortest distance between points through accessing all points, we need to compare all the node value and traverse all channels to get the optimal results. |
| |
| Keywords: | STL |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
