1 knapsack problem, using VC++ Realize is that algorithm design more important i...

设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。1.初始化。任意读入一个ASCII编码的文件，统计数据，建立哈夫曼树。2.编码。利用已建立的哈夫曼树给出每个字符的哈夫曼编码。3.图形化输出哈夫曼树中各结点以及哈夫曼编码。4.译码。利用已建立的哈夫曼树对输入文件进行译码并存储为.huf压缩文件。5.反译码。将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。

战车问题 战车问题 战车问题 战车问题-The issue of the chariot chariot chariot issues issues issues chariot chariot chariot problem issues

最段路径算法C++实现 实现工程清晰可见 仅供参考-Most paragraphs path algorithm C++ Realize realize the project clearly visible for reference only

jsp个人求职管理系统-jsp personal job management system

我做的一个图书馆数据库系统，有3，4个表。适合参考-I make a library database system, there are tables 3,4. Suitable reference

一辆汽车加满油后可行驶n公里。旅途中有若干个加油站。设计一个有效算法，指出应在哪些加油站停靠加油，使沿途加油次数最少。对于给定的n和k个加油站位置，编程计算最少加油次数。并证明算法能产生一个最优解-Fill up the car after driving an n km. There are a number of gas stations journey. Design an efficient algorithm that at which stations should stop to refuel along the way so that the least number of refueling. For a given n and k-station location, the calculation program for at least the number of refueling. And to prove that the algorithm can produce an optimal solution

演示C++读写EXCEL的方法,简单,通过ODBC完成基本的数据库功能-Demo C++ Literacy EXCEL method, simple, through the ODBC database to complete the basic functions

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

Visual Basic开发的 家庭收支管理系统后台数据库Acce-Visual Basic development of the household income and expenditure management systems background database Acce

C++数据库管理源代码，连接数据库后，可直接调用里面的函数对数据库进行操作，有修改-C++ Database management source code, database connectivity, you can directly call the function inside the database operation, has modified