登录
首页 » Visual C++ » PRIM

PRIM

于 2009-08-23 发布 文件大小:1KB
0 381
下载积分: 1 下载次数: 0

代码说明:

说明:  构造最小生成树的常用方法是Prim算法与Kruskal算法,二者都是基于贪心算法设计侧略。(Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.)

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

发表评论

0 个回复

  • opcproxy_src
    opc com ole opc代理存根源码(opc com ole opc proxy stub source)
    2010-09-28 08:09:32下载
    积分:1
  • VC-Communition
    一个简单的通迅录C++源码,不过很有用,可以值得参考一下。(A simple communication the recorded C++ source, however useful, can be worth considering.)
    2012-08-03 15:52:30下载
    积分:1
  • txt_TO_dat
    用于将txt格式数据,转换为.dat格式的数据,便于CASS处理。(Txt format for the data is converted to. Dat format, easy CASS processing.)
    2013-07-30 09:12:54下载
    积分:1
  • MyMFC
    说明:  在视图区画正弦函数曲线,并且在一个菜单下以对话框形式输入正弦图的起点和终点坐标。(In the view area sine curve drawing, and in the form of a menu in the dialog box enter the start and end the sine map coordinates.)
    2011-04-02 17:02:04下载
    积分:1
  • c
    说明:  用于实现校际运动会管理的程序,主要功能就是实现校际运动会管理(Used to implement inter-school sports management program, the main function is to realize the inter-school sports management)
    2011-07-10 14:58:02下载
    积分:1
  • STACK
    用C语言编写的堆栈接口,适用于各种环境,提供接口: STACK *initStack(int MaxRoom) void destroyStack(STACK **spp) void resetStack(STACK *sp) Boolean isStackEmpty(STACK stack) Boolean isStackFull(STACK stack) Boolean push(STACK *sp, USER_TYPE data) Boolean pop(STACK *sp, USER_TYPE *data) Boolean readTop(STACK stack, USER_TYPE *data) (C language implementation of the stack)
    2013-07-22 10:59:32下载
    积分:1
  • ctovb
    VB实现将C++头文件转换为VB模块的源程序.(VB implementation will c++ header file is converted into a VB source program module.)
    2013-08-07 18:56:55下载
    积分:1
  • LaocalChatSystem
    局域网聊天系统服务端,局域网聊天系统服务端,局域网聊天系统服务端(LAN server chat system, local area network server chat system, local area network server chat system)
    2009-12-26 14:27:48下载
    积分:1
  • Hook-lock
    让你随时想安全地挂机就挂机,加上锁安全。(Hook lock)
    2012-10-03 00:14:30下载
    积分:1
  • BST1
    运用伸展树的特性,每次插入新的结点后,调用展开函数,使得新结点成 为所建树的根结点。(Use of the characteristics of the splay tree, each time you insert a new node, call to function, making the new node into For the achievements of the root.)
    2012-03-17 22:55:35下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载