-
yongzhanshixianleicaozuo
自己做的一个用用栈实现类的操作,是课内作业,希望和大家互相交流(Own a type used by the realization of the operation of the stack is class work, hope and we can exchange ideas)
- 2007-12-25 22:28:05下载
- 积分:1
-
NewCode
清(英文)常见数据结构,代码实现,值得下载,值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
- 2012-11-21 14:33:49下载
- 积分: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
-
mataqipan
马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
- 2006-05-30 20:05:17下载
- 积分:1
-
Strassen-code
思塞恩算法
常用算法之一
算法导论提及(strassen algorithm which can run correctly)
- 2014-11-28 14:33:16下载
- 积分:1
-
list-and-array
数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
- 2013-10-17 11:32:30下载
- 积分:1
-
zhebanchazhao
实现折半查找,非递归形式,从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)
- 2012-08-29 12:35:25下载
- 积分:1
-
最短路径c++语言
说明: 用从c++写的floyd最短路径算法,可以求邻接矩阵任意两点的最短路径。(from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.)
- 2020-09-20 14:07:55下载
- 积分:1
-
lujing
图的邻接表生成,深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
- 2012-05-22 18:18:29下载
- 积分:1
-
tree
使用非递归的方法遍历二叉树,可以直接运行。(
Non-recursive binary tree traversal.)
- 2013-12-04 16:08:43下载
- 积分:1