Astar 精灵版本

使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task

这个程序用于实现哈希表，在初始化时赋予哈希表20个数值，然后点击查看当前哈希表，完成后点击重建哈希表-This process used to implement hash table, given in the initialization hash table 20 values, and then Click to view the current hash table, click on the reconstruction after the completion of hash table

duiwenjiandechuli fangbianguanli.

二叉数插入排序,及删除算法-two forks inserted several sequencing, and deletion algorithm

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

非常多的数据结构算法示例代码，以及关于算法的描述文档。-some classic data Data Structure Algorithm code and description.

一个关于哈夫曼编码的程序，用c++编的。可用于对数距的编码-one of Huffman coding procedures, using the c series. For a few from the right coding

利用栈实现算术表达式的求值。可以简单一些，假设表达式中含有一位整数，以及+、-、*、/、（、）。但不受此限制。

C# 之中 Serial port 的簡單連接教學 串口:/dev/ttyUSB0 鮑率:9600 位元:8 基數檢查碼:1

各种常用的排序算法源程序,包括快速排序/归并排序/带限期的排序以及贪心法的实现程序-various commonly used algorithm source, including rapid sequencing/merge sorting/ranking with the deadline and the greedy method to achieve procedures