资源列表
binary-and-haffman
- 初学者学习数据结构做的两个小程序，二叉树和哈夫曼树的源代码-Data structures for beginners to learn to do the two small programs, binary and source code of Huffman tree
Data-structure-
- 数据结构算法与应用, C++语言描。学习数据结构和算法的经典教程。-Data structure algorithm and application, the c plusplus language tracing. Learning data structures and algorithms classic tutorial.
floyd-algorithm
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 -Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to search for a given weighted graph algorithm shortest path between vertices.
kuaipai
- 设要排序的数组是A[0]……A[N-1]，首先任意选取一个数据（通常选用第一个数据）作为关键数据，然后将所有比它小的数都放到它前面，所有比它大的数都放到它后面，这个过程称为一趟快速排序。-The array is designed to sort A [0] ... ... A [N-1], first select an arbitrary data (usually the first choice of data) as the key data, and then all the num
Prim
- 描述tree的運用，並且利用Prim s來解決次問題-Describe the use of tree and use Prim' s to solve the time problem
Greedy
- 利用greedy來解決背包客重量問題，並做簡單排序動作-Backpackers use to solve the weight problem of greedy, and do a simple sort operation
prim
- Prim algorithm in C-Prim algorithm in C++
1-103
- 有向图，有向网，无向图，无向网的邻接表存储、增删顶点和边。-Directed graph, directed networks, undirected graph without adjacent to the network table to store, add and delete vertices and edges.
c-language-exercises
- c语言练习题，包括素数、取数字、完数因子、数列的四舍五入、fibonaci累加数列、以及其它的一些源代码-c language exercises, including the prime number, take number, complete the number of factors, several series of rounded, fibonaci cumulative series, as well as some other source
Sort
- 实用的冒泡排序及快速排序的C语言程序，程序思路清晰。-Practical bubble sort and quick sort of the C language program, the program clear thinking.
ZeroOne
- 求0，1序列的三种办法 第一种：递归深度搜索 第二种：栈结构深度搜索 第三张：神秘方法-Three methods to solve 0-1 sequence 1st: recursive DFS 2st: DFS on stack construction 3st: sprytical..
IA-algorithm-source
- IA算法源程序 IA算法源程序,可读性很好,非常易于学习 < 隐藏 -IA IA algorithm source algorithm source code, readable very good, very easy to learn IA algorithm source code, readable very good, very easy to learn < < Hide