登录
首页 » 数据结构 » 本程序是一个用prim算法寻找最小生成树的小程序。

本程序是一个用prim算法寻找最小生成树的小程序。

于 2023-06-09 发布 文件大小:74.93 kB
0 1032
下载积分: 2 下载次数: 1

代码说明:

本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.

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

发表评论

0 个回复

  • Classic data structures and algorithms and data structures vc source code vc cla...
    数据结构及算法经典 vc源码 数据结构及算法经典 vc源码-Classic data structures and algorithms and data structures vc source code vc classical algorithm source data structure and algorithm of the classical source vc
    2022-03-12 04:04:20下载
    积分:1
  • 循环链表的应用 循环链表的应用 很方便的实现
    循环链表的应用 循环链表的应用 很方便的实现-cycle Chain cyclic chain of convenience Implementation
    2022-03-24 21:43:06下载
    积分:1
  • /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means...
    迷宫算法(maze) /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.
    2022-08-08 06:28:42下载
    积分:1
  • 邻接表实现原理 C++ 源码
    应用背景图论相关,图论相关算及其应用。邻接表,邻接矩阵 的实现方法,。。图论相关,图论相关算及其应用。邻接表,邻接矩阵 的实现方法图论相关,图论相关算及其应用。邻接表,邻接矩阵 的实现方法关键技术邻接表,邻接矩阵 的实现方法,C++源码 源代码,使用 VS 2010 C++源码 源代码C++源码 源代码 编写的,真麻烦
    2022-02-13 02:07:46下载
    积分:1
  • create a binary tree using preorder before the establishment of a tree. transmis...
    创建一棵二叉树,采用前序遍历的方法建立一棵树,传递的参数为一个指向结点的指针的指针,目的是为了解决传值的问题,输入@符号的时候,表示一棵子树结束线索化二叉树,寻找当前结点的后继结点,寻找当前结点的前驱结点,中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder
    2023-02-13 17:50:04下载
    积分:1
  • 中常用的动态演示,可以帮助初学者更好的理解其的实现...
    数据结构中常用结构的动态演示,可以帮助初学者更好的理解其结构的实现-data structure used dynamic structure of the demonstration, and can help beginners a better understanding of its structure to achieve
    2022-02-07 07:48:28下载
    积分:1
  • 学习(c++)刚开始从C过渡到C++的人,看完这些后,会体会到C++的新特性。...
    数据结构学习(c++)刚开始从C过渡到C++的人,看完这些后,会体会到C++的新特性。-Data structure learning (c++) Has just begun the transition from C to the C++ Those who read them will realize that C++ The new features.
    2022-06-26 14:48:56下载
    积分:1
  • 编写管理系统
    数据结构编写管理系统-prepared data structure management system
    2022-07-02 07:04:34下载
    积分:1
  • 一个ADO+VC的源码,适用于初学者,里面还有其他控件用法
    一个ADO+VC的源码,适用于初学者,里面还有其他控件用法-A ADO+ VC source for beginners, there are other controls usage
    2023-06-05 19:50:04下载
    积分:1
  • 算法演示
    数据结构算法演示-demonstration algorithm data structure
    2022-11-26 15:00:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载