登录
首页 » Visual C++ » Kruskal

Kruskal

于 2011-05-17 发布 文件大小:2KB
0 270
下载积分: 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 个回复

  • 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
  • Brute-force-algorithm
    穷举算法,VC中的经典程序之一,适合初学者,(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
    2012-06-06 21:20:06下载
    积分:1
  • mataqipan
    马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
    2006-05-30 20:05:17下载
    积分:1
  • chazhao
    数据结构课程作业,查找算法。用哈希算法下实行查找(Data structure course work, search algorithm. Under the hash algorithm used to find)
    2009-07-08 02:41:51下载
    积分:1
  • mifeng
    c语言平时作业练习,包括输入输出,数组,链表等 c语言平时作业练习,包括输入输出,数组,链表等(output mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifengoutput mifeng)
    2014-04-28 16:01:53下载
    积分:1
  • Hash-table
    本代码主要实现了哈希表的设计,完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)
    2013-12-30 17:15:14下载
    积分:1
  • xiaobaishu
    参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写,很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)
    2013-08-29 16:09:43下载
    积分:1
  • 001
    二叉树的中序遍历,先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)
    2012-06-03 23:26:44下载
    积分:1
  • BinaryTree
    二叉树实现,整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)
    2012-12-28 10:40:23下载
    积分:1
  • yuyundonghui
    参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目,项目编号分别为 和 。由于各项目参加人数差别较大,有些项目取前五名,得分顺序为7,5,3,2,1;还有些项目只取前三名,得分顺序为5,3,2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单,内容包括各校所取得的每项成绩的项目号、名次(成绩)、姓名和得分;产生团体总分报表,内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据:对于 , , ,编号为奇数的项目取前五名,编号为偶数的项目取前三名,设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)
    2009-04-07 22:40:37下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载