资源列表
Data-structurech3
- 在c语言中，数据结构的完美基础学习代码，详细的例子，容易上手。-C language data structure the perfect based learning code, detailed examples, easy to use.
Data-structurech4
- 在c语言中，数据结构的完美基础学习代码，详细的例子，容易上手。-C language data structure the perfect based learning code, detailed examples, easy to use.
Data-structurech5
- 在c语言中，数据结构的完美基础学习代码，详细的例子，容易上手。-C language data structure the perfect based learning code, detailed examples, easy to use.
Data-structurech6
- 在c语言中，数据结构的完美基础学习代码，详细的例子，容易上手。-C language data structure the perfect based learning code, detailed examples, easy to use.
d_BitsOps
- manejo de bits. podes realizar
0-1packet
- 实现0—1背包问题，使用动态规划，有注释。-0-1 knapsack problem, the use of dynamic programming, there are notes.
minimumSpanningTree-
- 1． 利用克鲁斯卡尔算法求网的最小生成树。 2． 利用普里姆算法求网的最小生成树。 3． 要求输出各条边及它们的权值。-1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights.
LCS
- 最长公共子序列，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列。-The longest common subsequence, the English abbreviation for the LCS (Longest Common Subsequence). Which is defined as a sequence S, are
BalancedforksortTree-
- 二叉平衡排序树，能够实现不平衡调整，代码简单，格式清晰。作为课程设计已通过老师考核，可放心使用-Balanced binary sort tree imbalance adjustment, the code is simple, clear format. As curriculum design, teacher assessment, ease of use
Rails
- 使用队列和栈来模拟火车进站出战的过程。 有信息显示。代码有注释-Use the queue and stack to simulate the train came into the station played. Information display. Code annotated
ReaderAndWriter
- 操作系统课程设计，使用PV操作机器信号量、锁等机制，实现读者和写者互斥访问临界资源-Courses on operating system design, the use of PV operate the machine semaphore lock mechanisms, readers and writers to achieve mutually exclusive access to critical resources
1273
- poj1273 一道网络流图论的简单题，运用增光路的算法-poj1273 a simple graph problem