网站首页

登录

Kruskal

于 2011-05-17 发布文件大小:2KB

 0  185

下载积分: 1 下载次数: 4

我要下载

代码说明：

采用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)

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

floy
floyd算法数据结构求最短路径(floyd algorithm for data structure for shortest path)

2007-11-13 23:39:25下载

积分：1
BiTree
二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

2008-01-11 10:19:38下载

积分：1
bag1
使用不同的方法解决背包问题：本算法采用的是动态规划方法，比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)

2011-07-16 18:40:31下载

积分：1
约瑟夫环的循环链表实现
约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

2005-07-03 19:38:38下载

积分：1
kalman_C
说明：离散随机线性系统的卡尔曼滤波。其中13lman.c是卡尔曼滤波函数，4rinv.c是滤波函数中用到的矩阵求逆函数，13lman0.c是主程序。(discrete stochastic linear Kalman filtering system. 13lman.c which is the Kalman filter function, 4rinv.c filtering function is used in the matrix inversion function, is the main program 13lman0.c.)

2006-03-01 19:20:13下载

积分：1
stack
数据结构堆栈实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

2013-11-01 11:05:10下载

积分：1
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

2013-11-28 10:53:29下载

积分：1
Strassen-code
思塞恩算法常用算法之一算法导论提及(strassen algorithm which can run correctly)

2014-11-28 14:33:16下载

积分：1
有向图的邻接表存储的实现graph
有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)

2020-07-16 10:38:50下载

积分：1
Figure-topological-sort
说明：拓扑排序　对一个有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。　通常，这样的线性序列称为满足拓扑次序的序列，简称拓扑序列。注意：　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )

2011-03-22 17:19:14下载

积分：1

696518资源总数
106155会员总数
8今日下载