Visual+C+++6.0数据库开发技术与工程实践，附源码，下载后请看“光盘说明.txt”再使用。...

本代码用贪心算法实现会议安排的最佳顺序，其目标是使得能够安排的会议数量最多，是贪心算法的典型应用-code with the greedy algorithm to achieve the best arrangements for the order, its goal is to arrange the largest number of meetings, the greedy algorithm is a typical application

数据结构课程设计报告,算术表达式求值,自动辨别算符优先级,括号,将char型转换成int计算,再将结果显示,具有精美用户界面-data structure curriculum design, arithmetic expression evaluates automatically identify operator precedence, in brackets, char to int conversion type, the result shows that the user interface is attractive

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

数据结构中堆栈的具体应用，实现表达式的化简、求值等功能，可以自由确定变量，并且可以给变量赋值。Vc开发，包括了用户操作界面，输入输出清晰。-stack data structures to the specific applications, simplification of the expression, evaluates functions and the freedom to determine variables, as well as to assign values to variables. Vc development, including the user interface, input and output clear.

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.

科研管理系统是用PoerBuilder编写-research management system is used to prepare PoerBuilder

清华大学严蔚敏老师《数据结构习题集(C语言版)》的实验题1.4，长整数运算，已扩充了乘法和除法-Tsinghua University, Yan Wei-Min teacher

C#写的导入Excel表到数据库，可以选择工作簿，自己写的还不完善，有用的朋友可以借鉴一下，把完善传上来-C# written to the database table into Excel, you can choose the workbook, write their own is not perfect, can be useful to learn from some friends, to improve the Chuan-up

JAVA密码保护页面-password-protected pages JAVA

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-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)