-
yinhangjiasuanfa
一个很好的银行家算法，能运行(A good banker s algorithm, will be able to run)
- 2008-06-14 13:44:24下载
- 积分：1
-
浙江大学《数据结构》配套讲义
说明： 来自浙江大学的一套比较不错的数据结构入门资料(A good introduction to Data Structure from ZJU)
- 2020-09-12 09:47:59下载
- 积分：1
-
chess
在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)
- 2009-06-01 11:21:39下载
- 积分：1
-
bubblesort
这个是关于数据结构中冒泡排序算法的实现，大家可以利用这个为基础，进一步研究和利用排序(This is a data structure on the Bubble Sort algorithm, we can use this as a basis for further study and use of sorting)
- 2009-01-14 23:37:37下载
- 积分：1
-
astar
A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0)
2、重复以下步骤:
在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点
把当前节点从开放列表删除, 加入到封闭列表.
(A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
- 2013-04-04 11:06:42下载
- 积分：1
-
0-1bag
经典的0-1背包问题，程序可以自动输入并且有注释(Classical 0-1 knapsack problem, the program can automatically entered and annotated)
- 2014-01-31 08:54:38下载
- 积分：1
-
erchashu
二叉树的链式存储、先序中序遍历和层次遍历。（构造一棵树并输入数据，编写三个函数，非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法（这里的非递归以中序为例）。在主程序中调用这三个函数进行树的遍历，观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。）(Chain store binary tree, preorder traversal and hierarchy traversal.)
- 2013-12-07 23:16:06下载
- 积分：1
-
链表
说明： c 链表建立链表并且进行链表遍历打印输出编力数据(c lianbiao shurudangqianshujujiarudaolianbiao)
- 2020-06-18 19:00:02下载
- 积分：1
-
stuctures
本系统采用C语言编写，利用邻接链表实现最短路径问题，关键路径问题等(The system uses the C language, using adjacency list realize the shortest path problem, critical path issues)
- 2008-05-29 21:11:26下载
- 积分：1
-
stock
在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。
(Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores.)
- 2007-12-25 00:34:14下载
- 积分：1
