-
货郎担分枝限界图形演示
问题描述:某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路...
货郎担分枝限界图形演示
问题描述:某售货员要到若干城市去推销商品,已知各城市之间的路程(或旅费)。他要选定一条从驻地出发,经过每个城市一遍,最后回到驻地的路线,使总的路程(或旅费)最小。-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.
- 2022-01-25 16:17:23下载
- 积分:1
-
test1.txt中为要读入的英文文章,code.txt为生成的huffman编码,decoded.txt中为根据code.txt中内容解码后的结果。...
test1.txt中为要读入的英文文章,code.txt为生成的huffman编码,decoded.txt中为根据code.txt中内容解码后的结果。-test1.txt is used to store the article in English to be read, code.txt contains generated the huffman codes, decoded.txt for the contents according to code.txt decoded results.
- 2022-02-14 20:53:03下载
- 积分:1
-
电子白板代码(JAVA)
电子白板代码(JAVA)-Whiteboard code (Java)
- 2022-07-15 08:43:28下载
- 积分:1
-
一个解码的类,常用在条形码的解码中,是老外写的比较实用...
一个解码的类,常用在条形码的解码中,是老外写的比较实用-a decoder category, commonly used in bar code decoding, the foreigner is more practical writing
- 2022-01-25 19:50:48下载
- 积分:1
-
高级算法里的排序讲义ppt。sorting
高级算法里的排序讲义ppt。sorting- In high-level algorithm arrangement printed lecture ppt.
Sorting
- 2022-02-11 18:40:43下载
- 积分:1
-
自然灾害管理系统
建立文件,自然资源管理系统,统计全国各地历年的灾害发生情况,并且进行搜素排序,主要以链表为主,建立文件,进行存储,实现插入,查询,删除,排序等功能
- 2022-03-25 04:20:25下载
- 积分:1
-
这个程序主要是实现了一个数组的数组,当用户输入一个女的时候…
本程序主要是实现数组的全排列,当用户输入一个数字串时,程序将打印出该数字串的所有组合-This program is mainly to achieve an array of full array, when a user enter a number string, the program will print out the number of strings of all the combinations
- 2022-02-06 08:30:32下载
- 积分:1
-
这是一个典型的动态编程,提供了三种方法(用C代码实现…
这是一道典型的动态规划题 提供了三种方法(用C++代码实现)-This a typical dynamic programming that provides three methods (using C code realization)
- 2022-01-24 17:01:59下载
- 积分:1
-
封装了数据库的基本操作,再也不用为写esql的程序烦恼了,很方便
封装了数据库的基本操作,再也不用为写esql的程序烦恼了,很方便-package of the basic operation of the database, no longer have to write esql procedures trouble. Very convenient
- 2022-07-20 20:37:26下载
- 积分:1
-
问题描述:假设一个商店,有一个架子和一个仓库,当第…
问题描述: 假设一个商店,它有一个货架和一个仓库,当货架上的商品数量少于一定的数目时,从仓库运一定数量的商品摆到货架上,当仓库里的商品的数量少于一定的数目时,购买商品把仓库填满,商品的出售要按照商品的生产日期来,快要过期的商品要先出售。 解决问题的方法: 用了两个栈和 一个队列,把队列当作仓库,用一个栈作为货架,把另一个栈当作临时的存储箱。当要往货架上添商品时,先把作为货架的栈中的元素全都压到作为存储箱的栈中,再把仓库中的元素压到存储箱中,然后再把存储箱中的所有元素都压到货架上,这样,就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s
- 2022-07-13 01:56:00下载
- 积分:1