网站首页

the-dynamic-planning

于 2011-12-15 发布文件大小:59KB

 0  279

下载积分: 1 下载次数: 3

我要下载

代码说明：

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

zhaose
本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

2013-09-23 16:04:24下载

积分：1
xiererfenchazhao
希尔排序c++数据结构算法二分查找的递归算法(希尔排序c++数据结构算法二分查找的递归算法 )

2010-12-10 18:32:52下载

积分：1
data_structure
数据结构c源代码实现，大概有100个左右，基本上将所有的数据结构都有介绍(Data structures c source code to achieve, there are about 100 or so, basically all of the data structures are described)

2012-07-19 21:43:52下载

积分：1
tree
使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

2013-12-04 16:08:43下载

积分：1
point_to_line
计算点到直线的距离．输入两点坐标确定一个直线，再输入一个点的坐标，计算该点到直线的距离．(Calculated point to the straight line distance. Enter the coordinates of two points determine a straight line, and then input the coordinates of a point, to calculate the straight-line distance between points.)

2020-11-30 15:09:27下载

积分：1
MyKD Tree
KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者(KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners)

2015-06-24 20:10:33下载

积分：1
migong
以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)

2013-06-14 10:24:48下载

积分：1
StackandQueue
该ppt包含了栈和队列的数据结构及基本操作，同时还有栈的举例(This ppt contains the stack and queue data structure and basic operation, as well as examples of the stack)

2013-12-06 21:02:24下载

积分：1
xianduan
输入俩条线段的首尾坐标，用于判断俩条线段是否相交的(Used to determine whether the intersection of two line segments)

2011-05-22 22:47:16下载

积分：1
american_heritage
USACO中的American heritage，用C++编写，运用了树的遍历知识(the American heritage of USACO, with C++ prepared, using a tree traversal knowledge)

2013-07-21 18:31:10下载

积分：1

696516资源总数
106914会员总数
0今日下载

the-dynamic-planning

0 个回复

热门标签

热门下载