登录
首页 » Visual C++ » Kruskal

Kruskal

于 2009-06-27 发布 文件大小:24KB
0 74
下载积分: 1 下载次数: 2

代码说明:

  克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论


0 个回复

  • shellpaixu
    希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进(双语对照查看希尔排序(Shell Sort)是插入排序的一种。是针对直接插入排序算法的改进。 Hill sorting (Shell Sort) is a kind of insertion sort. Is to improve the direct insertion sort algorithm. )
    2013-07-18 15:11:39下载
    积分:1
  • BiTree
    二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)
    2008-01-11 10:19:38下载
    积分:1
  • 14160_1239592890aB1K
    纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
    2009-04-13 12:50:21下载
    积分:1
  • floy
    floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)
    2007-11-13 23:39:25下载
    积分:1
  • maze
    通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
    2010-09-02 21:43:32下载
    积分:1
  • heapsort
    说明:  从最后一个非叶子结点开始从后往前进行调整,保证了根下的所有子树都是最大堆,最后对根进行调整,使整棵二叉树为最大堆,保证了根结点为整棵数的最大值点,完成了建堆的过程,再将根结点跟最后一个结点进行交换,如此反复操作,则堆排序就完成了,其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)
    2008-11-11 22:53:42下载
    积分:1
  • FindMax
    求矩阵的最大值 有一个整型二维数组,大小为m行n列,要求分别找出其中最大值所在的行和列,以及该矩阵中的最大值。 要求: 1.编写自定义函数MaxVal 函数的原型为:int MaxVal(int arr[][N], int *m, int *n) 功能: 数组中最大元素的值通过MaxVal函数的返回值传递给主函数,最大元素的行值和列值分别通过m和n传递给主程序相应的变量。 2.main主函数的功能 (1)变量定义 (2)输入数组各元素的值 (3)以二维矩阵形式输出数组中各元素的值 (4)调用MaxVal函数,或者insert函数 (5)输出数组中最大元素的值和该数组元素的行值和列值。 3.所有关于数组的操作尽量使用指针 (FindMax)
    2010-10-12 23:15:24下载
    积分:1
  • LINK
    建立链表的算法: 新节点链入表尾建立链表: 动态分配第一个节点变量; 用指针head 妥善保存链表第一个节点的地址值; 依次动态分配一个新节点变量; 将上一个节点的指针域指向新生成的节点; 循环3),4)步骤,直到所有节点均连入链表; 将最后一个节点的指针域赋值为0; (Establish the list of algorithms: The new node links footer build list: Dynamic allocation of the first node variable Keep the list head pointer of the first node address value In order to dynamically allocate a new node variable The domain of a node pointer to the new generation of nodes Cycle 3), 4) step, until all nodes are connected to the chain Pointer field will last node assigned to 0 )
    2015-01-05 16:03:48下载
    积分:1
  • d
    有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)
    2013-11-29 14:32:18下载
    积分:1
  • bfs
    这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
    2013-12-05 15:56:50下载
    积分:1
  • 696518资源总数
  • 104607会员总数
  • 44今日下载