| 基于邻接表的图生成算法探讨 |
| |
| 引用本文： | 董加强.基于邻接表的图生成算法探讨[J].西昌学院学报(自然科学版),2009,23(2):43-45. |
| |
| 作者姓名： | 董加强 |
| |
| 作者单位： | 西昌学院,四川,西昌,615013 |
| |
| 摘 要： | 本文详细介绍了几类重要的图及其生成算法,包括随机图、K-邻接图、欧几米德邻接图。对于每一类图都用C语言描述其产生算法,并对算法的性能进行了简单的分析,同时对每一个算法用一组实际数据进行了演示,得到了具体的图。
|
| 关 键 词： | 邻接表 图 算法 |
The Research into Generating Algorithm of the Graph about Adjacent List |
| |
| DONG Jia-qiang.The Research into Generating Algorithm of the Graph about Adjacent List[J].Journal of Xichang College,2009,23(2):43-45. |
| |
| Authors: | DONG Jia-qiang |
| |
| Institution: | DONG Jia-qiang (Xichang College,Xichang, Sichuan 615013) |
| |
| Abstract: | In this paper, the author introduces several kinds of important graphs and its generating algorithms in detail, including random graph, K-adjacent graph and Euclidean adjacent graph. For every kind of graph, the author uses C language to describe its formation and algorithms, and analyzes the functions of each algorithm in brief.Meanwhile, the author gets a specific graph after using a set of data to demonstrate every algorithm. |
| |
| Keywords: | Adjacent list Graph Algorithms |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《西昌学院学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《西昌学院学报(自然科学版)》下载免费的PDF全文 |
|
