-
DP
说明: 动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)
- 2012-11-12 08:52:31下载
- 积分:1
-
radixsort
对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
- 2007-10-16 19:11:53下载
- 积分:1
-
sstring
利用串来比较数据大小,代码中有两个串,通过串来比较大小(
10/5000
Use the string to compare the data size)
- 2016-12-20 17:05:29下载
- 积分:1
-
DIJKSTRA算法实现的最短路径程序linjiebiaoshortpath
用邻接表表示的数据结构,及DIJKSTRA算法实现的最短路径程序(adjoining table with the data structure and algorithm DIJKSTRA the shortest path procedures)
- 2020-07-16 10:48:49下载
- 积分:1
-
Figure-topological-sort
说明: 拓扑排序
对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任
意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。
通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。
注意:
①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。
②若图中存在有向环,则不可能使顶点满足拓扑次序。
③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort
In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post
Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before.
Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence.
Note:
(1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing.
(2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence.
(3) a DAG topological sequence usually expressed some scheme is feasible.
)
- 2011-03-22 17:19:14下载
- 积分:1
-
9
说明: 任意给定输入的一个小写英文字符串a1a2a3…an-1an (n≥5)
输出:字符串Ana1An-1a2An-2a3…A2an-1A1an,其中Ai为ai的大写形式
例如,输入aybdx,则递归程序输出XaDyBbYdAx
(Any given input of a lowercase string a1a2a3 ... an-1an (n ≥ 5) Output: the string Ana1An-1a2An-2a3 A2an-1A1an, which Ai ai uppercase for example, input aybdx recursive program output XaDyBbYdAx)
- 2012-05-30 10:59:39下载
- 积分:1
-
paixu
各种排序算法的实现,如快速排序,冒泡排序,选择排序,堆排序,二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)
- 2010-09-28 22:20:55下载
- 积分:1
-
neu_SSD
东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)
- 2016-06-30 16:12:38下载
- 积分:1
-
huffman
使用C语言完成党的霍夫曼编码,主要使用树的数据结构,作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)
- 2013-07-15 23:59:47下载
- 积分:1
-
Data.Structures.For.Game.Programmers
说明: 详细介绍了游戏设计的数据结构注意事项,对与游戏中角色和游戏模式作者给予了督导的见解,书中语言为全英文但通俗易懂!很是推荐
(Data.Structures.For.Game.Programmers
Detailed data structure of the game design considerations, the role with the game and game modes of supervision given to insights, the book in English but the language is easy to understand! It is recommended)
- 2010-04-14 11:21:09下载
- 积分:1