登录
首页 » Visual C++ » PRIM

PRIM

于 2009-01-11 发布 文件大小:599KB
0 313
下载积分: 1 下载次数: 15

代码说明:

  PRIM算法 对任意给定的网和起点,用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)

文件列表:

prime
.....\PRIM
.....\....\prim.cpp.txt
.....\prime
.....\.....\123.doc
.....\.....\PRIM
.....\.....\....\prim.cpp.txt
.....\.....\PRIM算法.lnk.doc
.....\.....\心得体会.doc
.....\PRIM算法.lnk.doc
.....\心得体会.doc
.....\算法.doc

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

发表评论

0 个回复

  • AOV-Sort-Algorithm
    使用C语言编写的AOV网的拓扑排序,内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)
    2011-10-26 16:34:29下载
    积分:1
  • xunhuansaiqxf
    算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)
    2010-05-26 23:51:17下载
    积分:1
  • sort.cpp
    各种排序的模板实现,并分析了各种实现的时间复杂度及改进办法(Templates of various sort, and analyze the time complexity of the various implementations and ways to improve)
    2012-04-14 03:08:18下载
    积分:1
  • 算法集锦
    数据结构算法集锦:包括大量常用算法,如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)
    2005-06-28 19:55:07下载
    积分:1
  • point
    用分治算法(O(nlogn)复杂度)实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))
    2012-12-16 13:14:04下载
    积分:1
  • 1
    说明:  四路归并排序,将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)
    2012-12-07 14:16:36下载
    积分:1
  • red-tree
    红黑树 二叉树 性能比较分析 红黑树 二叉树(Red-black tree binary tree performance analysis,)
    2013-03-22 16:57:32下载
    积分:1
  • Josephus(data_struct)
    数据结构中基于约瑟夫环问题,用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
    2013-11-17 11:30:24下载
    积分:1
  • prim
    普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
    2012-05-17 09:11:15下载
    积分:1
  • B_Tree
    B-树的创建、插入、删除等一系列操作!(B-tree creation, insert, delete a series of manipulations!)
    2020-10-18 18:17:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载