资源列表
datastructure_c
- 数据结构（严蔚敏）配套纯c代的码,2009考研必备资料哦,我想很多人需要的,节约输代码的时间-Data structure (Yan Wei-min) of pure c-generation matching code, 2009 study section of the essential information Oh, I think many people in need, saving transmission time code
suanfa
- 数据结构算法大全，有需要的可以看下，基本包括了数据结构的各个方面-Data Structure Algorithm Guinness, there is a need can facie, the basic data structure includes all aspects of
Sort
- 各种排序算法 -Various sorting algorithms
Data_Struc
- 这个是严蔚敏版的数据结构上机教程中的部分源代码，都是自己写的，包括最短路径的dijkstra,floyd，最小生成树的prim,kruskal以及链表，Huffman Tree等等的c++代码-This is Yan Wei-min version of the data structure on the machine part of the tutorial source code, are written in their own, including the shortest path
usaco_chap1-5
- usaco自己做的1到5章的代码，可能部分缺失，不过大多数题都有源码。有很多很好的算法。-usaco own chapter 1-5 of the code, may be partly missing, but most have a source title. There are many very good algorithms.
NBased_HiPre
- 基于N进制的多精度问题 本代码可以处理N进制的多精度四则运算。 输入格式： 全是正数，string（或int）格式，请参见函数原型！开头不要有多余的零！-Based on the N-band multi-precision code can handle the N-band multi-precision arithmetic. Input format: is a positive number, string (or int) format, see the function p
Cpp1
- Kmeans算法的C++实现，很简短的一个算法-Kmeans algorithm C++ Achieved a very brief algorithm
Calstle
- 堡垒问题，有一点粗糙！！！ 是大二的一个作业题，拿出来喝大家分享-Bastion of the problem, it is rough! ! ! Is an operating title of his sophomore year, and show drink to share
Cpp1
- kmeans算法--很简便的一种。只不过有几个错误需要大家自己调试-kmeans algorithm- a very simple one. Only a few errors we need to debug their own
yinghangjia
- 银行家算法是避免死锁的一种重要方法，本课程设计要求用高级语言编写和调试一个简单的银行家算法程序。加深了解有关资源申请、避免死锁等概念，并体会和了解死锁和避免死锁的具体实施方法。-Bankers algorithm avoid deadlock is an important method, the curriculum design requires high-level language writing and debugging a simple procedure of Banker s
BinaryTree
- 遍历线索二叉树 遍历线索二叉树-Binary Tree Traversal clues clues Binary Tree Traversal
src
- PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, colle