-
Brute-force-algorithm
穷举算法，VC中的经典程序之一，适合初学者，(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
- 2012-06-06 21:20:06下载
- 积分：1
-
chechang
数据结构作业－停车场管理(operating data structure-the car park management)
- 2020-06-26 11:00:02下载
- 积分：1
-
K_Merge
文件的多路归并排序算法， C++描述（要求待排序文件已经事先有序）(C++ implementation of K-Merge Algorithm)
- 2010-08-03 10:24:48下载
- 积分：1
-
linearlist
说明： 线性链表的定义，遍历，查找，删除，排序。(Linear list definition, traversal, search, delete, sort.)
- 2011-04-07 14:08:14下载
- 积分：1
-
hanoi
Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)
- 2009-07-13 08:45:51下载
- 积分：1
-
template
说明： ACM及各类基本算法模板，包括数据结构，计算几何，字符串，图论，数学，高精度等许多常用模板(ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates)
- 2009-08-20 22:37:29下载
- 积分：1
-
Hash
基于Hash表的程序同源性分析,可以利用本程序进行两个程序源码比较相似度(Homology analysis Hash Table-based program, you can use the program two program source code similarity)
- 2012-11-04 16:45:04下载
- 积分：1
-
exp2-1
数据结构（第四版）第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
- 2014-12-31 09:14:51下载
- 积分：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
-
migong---cPP
迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)
- 2011-11-03 22:28:30下载
- 积分：1
