网站首页

登录

Kruskal

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

 0  295

下载积分: 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 个回复

structure-array-code
根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

2013-10-09 14:35:43下载

积分：1
erchashu
二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)

2013-12-07 23:16:06下载

积分：1
xianduan
输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

2011-05-22 22:47:16下载

积分：1
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)

2013-10-29 16:31:47下载

积分：1
lujing
图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

2012-05-22 18:18:29下载

积分：1
structure-array-code
根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

2013-10-09 14:35:43下载

积分：1
SelectSort
选择排序的实现，是一种基本的排序方法，但是时间复杂度相对较大。(Select Sort realization, is sort of a basic, but relatively large time complexity.)

2012-09-27 22:38:22下载

积分：1
Is_BST
This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.

2012-02-02 05:45:59下载

积分：1
zhebanchazhao
这半查找法是一种快速查找算法查找效率比较高容易实现理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)

2012-05-04 00:03:29下载

积分：1
reverse
本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)

2013-05-29 14:25:34下载

积分：1

696516资源总数
106914会员总数
0今日下载