资源列表
flint-1.5.1
- FLINT 是一个数论库，用C语言编写，它包括一个非常快的多项式算法库。-FLINT is a number theory library, using C language, it includes a very fast polynomial algorithms library.
desk
- 设计SIMPLE语言的词法分析器,编译原理的实验。-SIMPLE language, lexical analyzer design, compile principle experiment.
1
- 在一个由M*N个小正方形组成的矩形上，依次用两个相等的小正方形大小的矩形（此处所谓相邻是指两个正方形有一条公共边）不重复的覆盖该矩形区域。请构造出该问题的模型，设计算法求解所有可能的覆盖。-In a M* N small squares on the rectangle, followed by two small squares of equal size of the rectangle (here is the so-called two adjacent squares have a c
qsort
- 快速排序，c++， 数据结构作业，开发环境visual c++, qsort-quick sort
vector
- 代码设计了可以用来存图像轮廓的数据结构。类的设计。类似与OPENCV的设计方案-The code design can be used to save image outline of data structure. The design of the class. Similar and OPENCV design scheme
zxy--Huffman
- 此程序是数据结构中哈夫曼树的应用，实现电文的编码译码-This program is in the Huffman tree data structure applications, achieving coding and decoding messages
GrapeDeep
- 图的深度优先遍历，数据结构的很重要的一个内容，也很有难度，与大家分享-Graph depth-first traversal of the data structure is an important content, but also very difficult to share with you
Library-Management-System
- 图书管理系统（LMS）用于图书馆进行图书的管理，主要的功能包括借书、还书、查找等。不同的使用对象具有不同的权限。-Management, the main function of library management system (LMS) for library books were included library, but also books, look like. The use of different objects with different permissions
hanoi
- 汉诺塔算法的 Visual C++6.0语言实现 很简单，给大家分享 -hanoi written in Visual C++6.0
01
- 数学建模中的动态规划思想解决01背包问题。 包含整个c工程，内容完整，可运行。-Mathematical modeling of dynamic programming to solve 01 knapsack problem. C contains the entire project, content integrity, operational.
Dijkstra
- 主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。-DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.
ee
- 关于素数变化的题目，输入一对素数，每个是4位数，每次只能变化一位数，且变化后的数还是素数，求经过多少次变化，能变成另一个输入的素数-With regard to changes in the subject of prime numbers, enter a pair of prime numbers, each is a 4-digit, each only a few changes, and changes in the number of post-prime, or seeking m