登录
首页 » Visual C++ » prim

prim

于 2012-05-17 发布 文件大小:1KB
0 283
下载积分: 1 下载次数: 2

代码说明:

  普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)

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

发表评论

0 个回复

  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • B_Tree
    用控制台实现了经典的数据结构B树,可以通过测试文件.txt加载已有的B树,有插入,删除,查找的功能,加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
    2020-10-18 17:47:26下载
    积分:1
  • mapsearch
    数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
    2016-01-09 17:34:45下载
    积分:1
  • sstring
    利用串来比较数据大小,代码中有两个串,通过串来比较大小( 10/5000 Use the string to compare the data size)
    2016-12-20 17:05:29下载
    积分:1
  • 1
    说明:  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)
    2013-11-13 21:16:53下载
    积分:1
  • BresenhamLine
    在VC中实现Bresenham算法画直线(Bresenham algorithm in VC draw a straight line)
    2012-06-03 18:21:13下载
    积分:1
  • tanxinfangfa
    说明:  贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
    2006-05-15 21:50:01下载
    积分:1
  • joseph
    用链表解决约瑟夫问题。 约瑟夫环是一个数学的应用问题:已知n个人(以编号1,2,3...n分别表示)围坐在一张圆桌周围。从编号为k的人开始报数,数到m的那个人出列;他的下一个人又从1开始报数,数到m的那个人又出列;依此规律重复下去,直到圆桌周围的人全部出列。 其中包括一个实验报告,介绍了编程思路和输出结果截图。(List to resolve Joseph. Josephus is the application of a mathematical problem: Given n individuals (numbered 1, 2, 3, ... n, respectively) sitting around a round table around. From number k people began to count off the number to m the man out of the line his next person and from a number off, the man was out of the line number to m so regularly repeated down until roundtable around of the people all of the columns. Including a lab report describes the programming ideas and output screenshots.)
    2012-08-27 22:37:52下载
    积分: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
  • huffmancode
    哈夫曼编码程序,实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)
    2008-01-14 13:55:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载