一个管理系统全部

货郎担分枝限界图形演示 问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-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.

实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.

本人的练习2的答案， 供大家参考， 希望大家喜欢-ssd7exercise2

visual c++用于数据库编程的源程序-visual c++ for database programming source code

查询给定编号查询信息，可用于sqlsever的数据库管理-Look for a given number query information

问题来自趣味C程序设计题集。题目难度适合程序设计初学者。程序由本人自己设计，如果有需要的朋友，可以下载看看。本程序要点是数据类型的转换和公式的描述。

子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg, pruning Bound), which of course includes exhaustive law.

huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压.-huffman tree realize. the use of statistics to read TXT file generated huffman tree, thus TXT file compression and decompression.

本文介绍如何使用一些sql操作符

的地磅管理系统，还不错-the loadometer management system, but also good