登录
首页 » Visual C++ » Kruskal

Kruskal

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

  • order
    通过冒泡排序法和选择排序法实现对若干数字的排序。(To achieve the order of several numbers)
    2014-06-08 18:35:10下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • hamidunp2Boulatu
    关于中国邮递员的解决办法,个人觉得还不错的说(Chinese postman)
    2012-06-10 17:28:15下载
    积分:1
  • LStack
    堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)
    2012-03-26 08:35:26下载
    积分:1
  • C++
    说明:  标准答案习题1 1.1 简述C++语言程序的结构特点。 答: (1)C++程序由一个或多个函数组成,其中至少有一个主函数main(),程序从主函数开始执行,由主函数来调用其他函数。(Standard answer to Exercise 11.1 on C++ Language program structural characteristics. Answer: (1) C++ Procedures by one or more functions, of which at least one of the main function main (), the procedure started from the main function, from the main function to call the other function.)
    2008-11-25 16:16:27下载
    积分:1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分:1
  • Four-bracket-operator
    数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
    2011-12-12 10:51:31下载
    积分:1
  • test
    使用vc编写的一个动态链接库,测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
    2010-05-28 23:27:09下载
    积分:1
  • luowenfeng
    建立试题库文件,随机产生n个题目; 题目涉及加减乘除,带括弧的混合运算; 利用栈求解表达式的值; 随时可以退出; 保留历史分数,能回顾历史,给出与历史分数比较后的评价( The establishment of test database file, the subject of n randomly generated topics related to addition, subtraction, mixed operations with parentheses use the value of the expression stack solution ready to quit to preserve the historical scores, can look back at history, and history gives the comparison of scores Evaluation 保留历史分数,能回顾历史,给出与历史分数比较后的评价)
    2020-12-29 23:09:01下载
    积分:1
  • binary-tree
    数据结构 二叉树的操作,可以对二叉树进行最基本的操作,先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)
    2012-03-20 21:19:43下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载