staff of the Information Management System

单源最短路径问题的动态规划算法,请大家多多指教-single source shortest path problem of dynamic programming algorithm, please exhibitions

经典100例c语言编辑程序~包含很多经常考试中考到的程序~很值得一看!-100 cases of classical language editor c ~ include many regular examinations as well as to the procedures to a very eye-catcher!

图形图像处理中常用的编码，拉普拉斯高斯编码、游程编码、算术编码、Huffman编码、Sobel编码等。-graphics processing commonly used coding, coding Laplace Gaussian, RIc, arithmetic coding, Huffman coding, coding Sobel.

Many applications use connection/object pool. A program may require a IMAP connection pool and LDAP connection pool. One could easily implement a IMAP connection pool, then take the existing code and implement a LDAP connection pool. The program grows, and now there is a need for a pool of threads. So just take the IMAP connection pool and convert that to a pool of threads (Copy, paste, find, replace????). Need to make some changes to the pool implementation? Not a very easy task, since the code has been duplicated in many places. Re-inventing source code is not an intelligent approach in an object oriented environment which encourages re-usability. It seems to make more sense to implement a pool that can contain any arbitrary type rather than duplicating code. How does one do that? The answer is to use type parameterization, more commonly referred to as templates.-connection/object pool. A program may require a IMAP connection po ol and LDAP connection pool. One could easily im plemen

计算机科班学生的数据结构课的-‘表’（VC写的源程序）-computer classes to the students of the class of data structure-the "Table" (VC was made of the source)

这个类，使数据库编程变的更简单-this category, the database programming change simpler

算术编码熵编码Arithmetic Coding-Arithmetic Coding

Delphi 2007 Remobjects分布式ERP模型-Delphi 2007 Remobjects Distributed ERP model

组合问题，从M个不同字符中任取N个字符的所有组合-Combination of issues, from the M different characters of any N-character check all combinations

1．定义顺序栈的数据结构 2．编写函数实现的栈的初始化、入栈、出栈、判断栈是否为空的算法，并应用与表达式的括号匹配检测。 3．定义队列的链式数据结构 4．编写函数实现链队列的入队列、出队列算法-1. Stack data structure defines the order of 2. Write a function to achieve the initialization of the stack, stack, out of the stack, to determine whether the stack is empty the algorithm, and application and matches the test expression in parentheses. 3. Chain data structure defines queue 4. Write a function to achieve chain of queues into queue, a queue algorithm