资源列表
DFS.rar
- 深度优先算法，用深度优先来遍历树结构，能够取得很好的复杂度,Depth-first algorithm, using depth-first traversal tree structure to achieve a good complexity
ds_4
- 1．定义二叉树的链式数据结构。 2．编写函数，创建下图所示的二叉树。 3．编写函数输出二叉树的先序、中序、后序遍历。-1. The definition of binary tree data structure chain. 2. Write a function, create a binary tree as shown in figure below. 3. Write function, the output of the first binary sequence, in o
7
- 1．定义数据结构。 2．编写函数，实现插入排序算法。 3．编写函数，实现希尔排序或快速排序等效率较高的算法。-1. Define the data structure. 2. Write a function to achieve insertion sort algorithm. 3. Write a function to achieve Hill sort or quick sort, etc. more efficient algorithms.
yuesefu
- 用c语言开发的来实现约瑟夫环问题的求解程序。-C language development to achieve the Josephus problem solver.
cow_picnic
- 在有向图中从若干个点出发，寻找共同可达的点-find the point that some cows can have a picnic togeter in a digraph
The-matrix-the-chain-multiplication-
- 运用动态规划思想，解决矩阵链最优算法问题。-The use of dynamic programming to solve the problem of the optimal matrix chain algorithm.
DS_chap3_prj5
- 地图染色问题。地图上相邻的区域染成不同的颜色，地图用矩阵表示。-Map coloring problem. Map region adjacent dyed a different color, a matrix map.
Dijkstra
- 本代码应用Dijkstra算法，实现了找最短路径问题，仿真了整个过程，是一个高效实用的代码值得下载实用。-This code apply Dijkstra algorithm to find the shortest path problem, the simulation of the whole process is a practical and efficient code is worth the download utility.
Hanoi
- 汉诺塔：汉诺塔（又称河内塔）问题是源于印度一个古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。-Tower of Hanoi: The Tower of Hanoi (also known as Tower of Hanoi) is derived from an ancient Indian le
milk3
- usaco 训练 第1.4.4题 Mother s Milk ac代码-usaco Training Section 1.4.4 Question Mother s Milk ac code
jose1
- 递推算法求解扩展约瑟夫环问题，C++源代码-Recursive algorithm for solving extended Joseph ring problem, C++ source code
xuejigunali
- 学生管理系统，能够实现对学生的成绩进行排序，并且能够增添，修改，删除学生信息-Student management system, can realize in sorting, student performance and the ability to add, modify, delete student information