登录
首页 » Visual C++ » hamidunp2Boulatu

hamidunp2Boulatu

于 2012-06-10 发布 文件大小:1494KB
0 143
下载积分: 1 下载次数: 15

代码说明:

  关于中国邮递员的解决办法,个人觉得还不错的说(Chinese postman)

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

发表评论


0 个回复

  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • structure-array-code
    根据队列搜索算法的基本思想,现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能,可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)
    2013-10-09 14:35:43下载
    积分:1
  • strcon
    对于给定的n个字符串,请找出一种最佳的连接方式,使得采用该连接方式得到的字符串在所有连接的结果中,字典序最小(For a given n-string, find an optimal connection, making use of the connection string to get the results in all connections, the lexicographic minimum)
    2011-09-02 16:52:40下载
    积分:1
  • dijkstra
    dijkstra算法,用于寻找已建立图的最短路径,是非常有用的一个算法(Dijkstra algorithm, has been established for finding the shortest path map is a very useful algorithm)
    2007-07-15 14:14:48下载
    积分:1
  • min-dist
    图中计算最短路径,必须覆盖所有的节点,效率很高(to compute the shortest path in the graph)
    2012-01-06 00:03:33下载
    积分:1
  • maze
    通过学习奥赛培训课程,利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
    2010-09-02 21:43:32下载
    积分:1
  • 14160_1239592890aB1K
    纯C语言写的小型通用数据库,一个C数据结构组科技小组的作品,附有开发思路PPT,这可是一个宝贵的资源哦,更底层的东西,运行于DOS提示符,可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)
    2009-04-13 12:50:21下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • StringClass
    这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
    2006-05-17 17:46:58下载
    积分:1
  • length
    利用佛洛伊德算法计算节点之间的最短路径,用于复杂网络中计算平均路径长度(average path lengh)
    2011-09-01 11:13:51下载
    积分:1
  • 696518资源总数
  • 104670会员总数
  • 38今日下载