社稷

A*算法只要求产生问题的全部状态空间的部分结点及关系,就可以求解问题了,搜索效率较高。当然由于A*算法中没有回溯，因此某些情况下可能会找不到正确的解过程。 -A* algorithm only requires a problem all part of the state space and the relationship between nodes, we can solve the problem, the search more efficient. Of course, as a result of A* algorithm is not retroactive, so some cases may be unable to find the correct solution of the process.

For Call Center Operators for the work time given- For Call Center Operators for the work time given

；；；；！[endif]-->；；；！[endif]-->；；；！[endif]-->；；；！[endif]-->；；-->；

VB 项目护照自动化系统。我的项目标题是护照自动化系统。在这个项目中，我们可以开发 5 模块 （如登录，填写的表格与必要的证据，验证申请人的信息有效性检查和尤其是对申请人的护照问题。在此登录模块中，我们可以执行，执行输入到登录网站的不同的演员，然后填充可以做小学和验证，通过验证检查和签发护照可以做配角。

数据结构中解决约瑟夫环问题的代码，里面只有源代码，大家用TC2编译一下就可以用了：）。-data structure to solve the problem of Josephus code, only the source code, we use TC2 compiler can use it with a :).

script for apotec sofware (visual basic 6.0)

利用c++写的双向链表操作，有头插入，尾插入，中间寻找“朋友“的方式插入，适合简单数据结构分析

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)

A template solution for C++ database development Description: A template class that can write,read,modify & delete objects of any class/structure to a database.

哈夫曼编码/译码 利用克鲁斯卡尔算法计算信息的哈夫曼编码，以便更好的利用通信信道。-Huffman encoding/decoding algorithm using Kruskal Huffman encoding of information in order to better use of communication channel.