-
Kruskal
采用Kruskal算法求最小生成树主要数据结构
edgeset GE 存放图中的所有边
int n,int e 存放图中的顶点数与边数
edgeset C 存放生成树中的边
vexlist gv 图中结点的顶点值
adjmatrix s 用来处理图中结点的查找与合并
int m1,m2 一条边上两顶点所属集合的序号
int k 最小生成树中的边数
int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)
- 2011-05-17 10:22:56下载
- 积分:1
-
qiongju
八皇后算法,用的是最简单的穷举法,在VC++6.0上编写的。(Eight Queens algorithm, using the simplest method of exhaustion, in VC++6.0 written on.)
- 2013-08-14 22:21:28下载
- 积分:1
-
xunhuansaiqxf
算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)
- 2010-05-26 23:51:17下载
- 积分:1
-
Large_integer_multiplication
算法分析与设计——大整数乘法。
计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)
- 2009-05-08 14:21:06下载
- 积分:1
-
Huffman
哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)
- 2010-06-09 13:09:47下载
- 积分:1
-
kruscal_Primspanningtree
最小生成树两种经典算法,kruscal和Prim算法(spanning tree)
- 2010-07-14 10:10:54下载
- 积分:1
-
哈夫曼树解码和编码
哈夫曼树,基本的数据结构,用来编码和解码、用数组作为存储结构实现,
- 2023-04-13 11:00:11下载
- 积分:1
-
sstring
利用串来比较数据大小,代码中有两个串,通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分:1
-
InserSigList
单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)
- 2016-02-18 15:09:12下载
- 积分:1
-
SeqQueue
数据结构循环队列的实现 在visual c++6.0运行(Circular queue data structure to achieve the visual c++6.0 run)
- 2013-06-15 16:27:32下载
- 积分:1