登录
首页 » Visual C++ » Kruskal

Kruskal

于 2009-06-27 发布 文件大小:24KB
0 90
下载积分: 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 个回复

  • Cpp2
    c-w算法,讲述一种分配运输的节约方法,适合于车辆的调度(c-w algorithm,About one distribution transport saving method, suitable for vehicle scheduling)
    2011-12-07 15:02:14下载
    积分:1
  • linearlist
    说明:  线性链表的定义,遍历,查找,删除,排序。(Linear list definition, traversal, search, delete, sort.)
    2011-04-07 14:08:14下载
    积分:1
  • InverseList
    说明:  链表逆转,实现单链表的逆转程序,数据结构(List Inverse)
    2011-04-04 11:15:58下载
    积分:1
  • HEAP
    poj 实现堆结构的源代码。。。话说其实没什么实际功能好么(poj achieve heap structure of the source code. . . In fact, the actual function of saying okay nothing)
    2013-11-21 23:03:15下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • edge-betweenness
    计算边介数,复杂网络,中心性计算,介数也可以计算,运用了数据结构,计算大量数据(edge betweenness,complex network, centrality)
    2021-05-15 01:30:03下载
    积分:1
  • SplitADT
    链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)
    2007-03-30 20:48:18下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • Classic-single-linked-list
    单链表是C经典数据结构算法和数据结构,希望这对大家学习有点用(Classic single-linked list data structure in C algorithms and data structures, which we hope to learn a little bit with)
    2011-08-02 12:33:26下载
    积分:1
  • 123
    中科大数据结构全部上机实验的实验程序以及报告,内容包括多项式,图,栈,SQL语言……(All experimental procedures USTC data structures as well as reports on experiments, including polynomial, maps, stack, SQL language ......)
    2020-10-14 19:57:30下载
    积分:1
  • 696518资源总数
  • 105282会员总数
  • 11今日下载