This procedure is running under Turbo c, the main function of the completion of...

货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

输入稀疏矩阵中非零的元素，然后建立整个矩阵，实现这两个矩阵相加、相减和相乘运算。 -Enter non-zero elements of sparse matrix, and then build the whole matrix, to achieve these two matrices are added together, subtraction, and multiplication operations.

我大三本科做的数据结构课程设计。题目为学生成绩管理系统，有详细的文字说明和源代码。-I do junior undergraduate data structures course design. Entitled to student performance management system, a detailed written instructions and source code.source code.

数据结构停车场问题-data structure parking problems

extremeDB s sample code,useful for you-extremeDB"s sample code, useful for you! !

有很陡数据结构的flash,PPT,帮你快速理解算法,一步步执行理解方便-There are steep data structure, flash PPT, to help you quickly understand the algorithm, a step by step to facilitate the implementation of the understanding

将xml格式的文件导入到 数据库中,将xml格式的文件导入到 数据库中-Xml file will be imported into the database, the xml file into database

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

Java和Sql Server2005做的 学生学籍管理系统，Java + SQL Server2005 + MyEclipse6.0，作为计算机学院的课程设计已通过老师审核，Word文档，UML建模，代码，数据库文件一应俱全。

“e拍”在线拍卖系统 第一阶段:创建数据库和表 第二阶段:创建DAO层接口和实现类 第三阶段:创建Biz层接口和实现类 第四阶段: 开发并配置Action和ActionForm 第五阶段:实现用户注册功能 第六阶段:开发用户登录功能 第七阶段:开发用户注销功能 -epai