图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》...

这个系统将特别为那些初学者提供帮助。。

内容简介： 查找 递归 链表基本操作练习 排序 栈、队列基本操作练习 数据结构讲义-Description: Find a recursive practice basic operation list sort stack, queue data structure to practice basic operation notes

程序存储问题:设有n 个程序{1,2,…, n }要存放在长度为L的磁带上。程序i存放在磁带上的长度是Li ，1≤i≤n 程序存储问题要求确定这n 个程序在磁带上的一个存储方案，使得能够在磁带上存储尽可能多的程序。 编程任务： 对于给定的n个程序存放在磁带上的长度，编程计算磁带上最多可以存储的程序数。 数据输入：由文件input.txt给出输入数据。第一行是正整数n，表示文件个数。接下来的1 行中，有n 个正整数，表示程序存放在磁带上的长度。 结果输出: input.txt output.txt 6 50 5 2 3 13 8 80 20 -program storage problem : There n procedures (1,2, ..., n) to be stored in the length of the L tape. I kept in the proceedings on the tape length is Li, 1 i n storage procedures to seek to establish that n procedures on tape storage of a program that allows the tape to store as much as possible the procedure. Programming tasks : to the n procedures stored in the tape length, calculated programming on tape can store up to the number of procedures. Data input : from the document input.txt given input data. The first line is a positive integer n, said the document number. Following a visit, n is an integer, said procedures stored on tape length. Results output : input.txt output.txt 6 50 5 2 3 13 8 80 20

数据库基础教程chm-database based tutorial chm

课程管理系统 适用于教师 -course management system applicable to teachers

数据库设计指南-60个设计技巧值得参考-Database Design Guide-60-design skills worthy of reference

huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压.-huffman tree realize. the use of statistics to read TXT file generated huffman tree, thus TXT file compression and decompression.

这是一个数据结构演示系统，可以演示二叉树、二分查找等数据结构-This is a data structure presentation systems, you can demo binary tree, binary search data structure, etc.

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

酒店管理程序，主要用于小型饭店点菜收银，功能完备-Hotel management program, mainly for small a la carte restaurant cash register, a fully functioning