摘要
本文详细介绍了几类重要的图及其生成算法,包括随机图、K-邻接图、欧几米德邻接图。对于每一类图都用C语言描述其产生算法,并对算法的性能进行了简单的分析,同时对每一个算法用一组实际数据进行了演示,得到了具体的图。
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.
出处
《西昌学院学报（自然科学版）》
2009年第2期43-45,共3页
Journal of Xichang University(Natural Science Edition)
关键词
邻接表
图
算法
Adjacent list
Graph
Algorithms
