| 图的遍历的分析与算法设计 |
| |
| 引用本文： | 俞惠芳.图的遍历的分析与算法设计[J].青海师范大学学报(自然科学版),2005(4):54-55,59. |
| |
| 作者姓名： | 俞惠芳 |
| |
| 作者单位： | 青海师范大学,计算机系,青海,西宁,810008 |
| |
| 摘 要： | 本文分析了图的深度优先搜索和广度优先搜索遍历的思想,用邻接表设计了其算法,并介绍了图的遍历的应用.
|
| 关 键 词： | 图 遍历方法 邻接表 算法 |
| 文章编号： | 1001-7542（2005）04-0054-03 |
| 收稿时间： | 2005-09-09 |
| 修稿时间： | 2005-09-09 |
Analysis and algorithm design of graph visiting |
| |
| YU Hui-fang.Analysis and algorithm design of graph visiting[J].Journal of Qinghai Normal University(Natural Science Edition),2005(4):54-55,59. |
| |
| Authors: | YU Hui-fang |
| |
| Institution: | Department of Computer Science, Qinghai Normal University, Xining 810008, China |
| |
| Abstract: | The thesis analyses the thoughts of Depth- First Search and Breadth- First Search of graph visithag, afterwads I design the algorithms with Adjacency List and introduce its applications. |
| |
| Keywords: | graph visiting methods adjacency list algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
