Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 -the book is on the computer science and engineering fields, the basis for one of the subjects of study -- data structure and algorithm expertise with. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and Figure basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design method data structures and algorithms for continuous learning and research have laid a solid foundation. Even more valuable is that the book not only of theoretical knowledge, also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm Platform: |
Size: 11776064 |
Author:猫扑 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 -the book is on the computer science and engineering fields, the basis for one of the subjects of study -- data structure and algorithm expertise with. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and Figure basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design method data structures and algorithms for continuous learning and research have laid a solid foundation. Even more valuable is that the book not only of theoretical knowledge, also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm Platform: |
Size: 3295453 |
Author:情书 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-the book is on the computer science and engineering fields, the basis for one of the subjects of study -- data structure and algorithm monographs. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and map basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design methods, data structures and algorithms for continuous learning Research and lay a solid foundation. Even more valuable is that the book not only on the theoretical knowledge but also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm mat Platform: |
Size: 11777659 |
Author:周小川 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm monographs. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and map basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design methods, data structures and algorithms for continuous learning Research and lay a solid foundation. Even more valuable is that the book not only on the theoretical knowledge but also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm mat Platform: |
Size: 11777024 |
Author:周小川 |
Hits:
Description: 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparable. Platform: |
Size: 3072 |
Author:唐海浪 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 -the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm expertise with. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and Figure basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design method data structures and algorithms for continuous learning and research have laid a solid foundation. Even more valuable is that the book not only of theoretical knowledge, also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm Platform: |
Size: 11776000 |
Author:猫扑 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 -the book is on the computer science and engineering fields, the basis for one of the subjects of study-- data structure and algorithm expertise with. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and Figure basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design method data structures and algorithms for continuous learning and research have laid a solid foundation. Even more valuable is that the book not only of theoretical knowledge, also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm Platform: |
Size: 3295232 |
Author:情书 |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。
本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。
本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-The book is about computer science and engineering fields of basic research one of the subjects- the data structure and algorithm monographs.
This book in a brief review of basic C++ program design based on the concept of comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm algorithm design, etc. methods for data structure and algorithm to continue to study and research has laid a solid foundation. More valuable is, this book introduces not only theoretical knowledge, but also provided more than 50 applications and more than 600 exercises Road.
Broad authority of the contents of this book, the structure of a clear and reasonable, is a new data structure and algorithm-related teaching materials for computer science and engineering practitioners in the field is also a good reference book. Platform: |
Size: 17261568 |
Author:ichoo |
Hits:
Description: 分支定界算法C语言实现源程序,标准C源代码，直接可以运行，程序有详细的说明-Branch and bound algorithm for C language source code implementation, the standard C source code can run directly, the program has a detailed description of Platform: |
Size: 146432 |
Author:wanghao |
Hits:
Description: 最优装载方案
成绩: 0 / 折扣: 0.8
试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量
接下来的1行中有n个正整数，表示集装箱的重量
输出：最大载重量
例如：
输入：
5 10
7 2 6 5 4
输出：
10-Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10 Platform: |
Size: 958464 |
Author:cj |
Hits:
Description: 数据结构和算法，非常经典，讲的很详细！第一部分 基础知识
第一章 C++程序设计
第二章 程序性能
第二部分 数据结构
第三章 数据描述
第四章 数组和矩阵
第五章 堆栈
第六章 队列
第七章 跳表和散列
第八章 二叉树和其他树
第九章 优先队列
第十章 竞赛树
第十一章 搜索树
第十二章 图
第三部分 算法设计方法
第十三章 贪婪算法
第十四章 分而治之算法
第十五章 动态规划
第十六章 回溯
第十七章 分支定界-Data structures and algorithms, very classic, talked in great detail! The first part of the basic knowledge of first chapter C++ Program Design Chapter II The second part of the data structure of program performance data described in Chapter III Chapter IV Chapter V array and matrix stack, queue, Chapter VI Chapter VII Chapter VIII of the jump table and the hash Binary trees and other tree priority queue IX Chapter X Chapter XI competition tree search tree diagram the third part of Chapter XII Chapter XIII greedy algorithm design method of divide and conquer algorithms Chapter XIV Chapter XV of the dynamic programming algorithm for 16th Chapter XVII Chapter backtracking branch and bound Platform: |
Size: 17229824 |
Author:孙继磊 |
Hits:
Description: 本程序是用分支定界法求最短路径的程序，用C++编写。采取的基本思想是：使用最小优先队列分支界限法来构建程序，细节是对于每个节点，包含三个变量：当前走过的路径长度、当前的花费和该节点对应的实际城市的编号。关于确定节点优先级，我们规定首先以“当前走过的路径长度”来确定优先级，当路径长度相等时，以“当前的花费”来确定优先级。同时，我们还定义两个数组dist[i]和pric[i]保存当前求得的从源城市到每个城市的最短距离和花费，用于剪枝时的评判标准。-This procedure is to use branch and bound procedure for seeking the shortest path, using C++ to implement. The basic idea is: Using the minimum priority queue Branch and Bound method to build a program, the details are: for each node, containing three varibles: the current path length traversed, the current cost and the node number corresponding to the actual city. On the determination of priorities, we first use the current path length traversed to determine the priority if the path length is equal, then current cost is used to determine priority. At the same time, we also define two arrays dist [i] and the pric [i] to save the current shortest distance and cost from the source city to every other city . This will be used as the evaluation criterion when pruning. Platform: |
Size: 61440 |
Author:李贺 |
Hits:
Description: 用C实现了分支限界算法，读者可以运行该程序理解分支限界算法-Achieved with the C branch and bound algorithm, readers can run the program understand the branch and bound algorithm for Platform: |
Size: 24576 |
Author:zhou |
Hits:
Description: 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑：C:INPUT.TXT )
2. 執行結束會產生一個排序後的文字檔 ( 路徑：C:OUTPUT.TXT )
3. 給定的初始盤面一定有解
本程式採用的演算法策略為Best-first search with branch-and-bound algorithm
1. 使用Max heap 實作Priority queue
2. 使用bound function 估計目前盤面走至答案最少需要幾步
第一部分
所謂 heap property (或稱 heap condition) 是指每個 node 內的資料比它左右兩側 child nodes 內的資料都小 (但左右兩 child nodes 之間並無一定的關係)。
雖說 heap 在觀念上是一棵 complete binary tree, 實際上是存在一個陣列當中 root 存在 A[1], 接下來將 A[2] 與 A[3] 由左到右依序補滿第二層, 再將 A[4], A[5], A[6], A[7] 由左到右依序補滿第三層…。-1. This program is running from the path to read a text file (path: C: INPUT.TXT)
2. Implementation of the end will produce a sorted text file (path: C: OUTPUT.TXT)
3. Given the initial disk of at least one solution
The program uses the algorithm strategy Best-first search with branch-and-bound algorithm
1. Using the Max heap implement Priority queue
2. Bound function is estimated using the disk at least a few steps away to answer
The first part
The so-called heap property (or called heap condition) refers to the information within each node than its left and right child nodes of the information is small (about two child nodes, but there is no necessary relationship between).
Although the concept of heap is a complete binary tree, in fact there exist root among an array A [1], then the A [2] and A [3] from left to right order of fill over the second layer, then A [4], A [5], A [6], A [7] from left to right order of filling up the third tier .... Platform: |
Size: 2048 |
Author:zelda |
Hits:
Description: 分支限界法之布线问题 一、要求：
1、输入电路板区域n*m以及布线的起始位置和结束位置；
2、输出布线方案；
3、可以使用c或者vc实现
二、问题分析及实验原理：
在n*m的方格阵列中存在封锁区域（布线时必须绕开的区域），找到起始位置到目标位置的最短路径。从目标位置开始向起始位置回溯，逐步构造最优解。每次向标记距离比当前方格标记距离少1的相邻方格移动，直到到达起始方格为止。-Branch and bound method of a wiring problem, requirement: 1, enter the circuit board wiring region n* m and the start position and end position 2, output routing program 3, you can use c or vc achieve two, the analysis and experimental principle : n* m in the box in the array block area there (wiring must be bypassed in the region), the starting position to the target location to find the shortest path. Starting from the target location back to the starting position, and gradually construct the optimal solution. To mark each box marked distance from the current less than 1 in its adjacent cells move up until you reach the starting grid. Platform: |
Size: 1024 |
Author:杨博文 |
Hits:
Description: 最大团的分支限界法编程，棋盘覆盖问题c++编程-The largest group of branch and bound program, the board cover problem c++ programming Platform: |
Size: 50176 |
Author:李倩 |
Hits:
Description: 本程序用C语言编写实现，程序源代码文件为“分支定界实现源程序.c” ，在windows XP下用VC++6.0上编译运行通过，生成可执行文件“分支定界实现程序.exe” 。运行程序时，请将题目中所给的文件“m1.txt” 和“m2.txt”与可执行文件“分支定界实现程序.exe”放在同一个文件夹下，然后双击打开“分支定界实现程序.exe”即可运行程序。-The program using the C language implementation, program source code file " source c" branch and bound by VC++6.0 compile and run on windows XP, and generate an executable file " branch and bound procedures. Exe . Run the program, set the title to the document " m1.txt m2.txt executable file branch and bound implementation program. Exe" in the same folder, and then double-click to open the branch and sector program. exe " to run the program. Platform: |
Size: 150528 |
Author:biscuit |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。
-This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. Book in a brief review of the basic C++-based program design concept, a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms algorithms divide and conquer, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Platform: |
Size: 17233920 |
Author:龙飞华 |
Hits:
Description: 书的内容建立在对MSDN和MFC SOURCE CODE的大量分析上，该书对于希望学习MFC的人来说，是较有价值的。可惜出版社好象只在几个城市针对学生作销售，虽然学生反应不错，但是外界知道不多。
原来也曾有意建立一个编程站点，一直觉得没有工夫。最近深感交流之重要且匮乏，于是遍访一些中文编程站点。发现你的站点不错，于是想借贵地放在下的一点“愚作”，希望可以对VC的学习有所益。
-This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. Book in a brief review of the basic C++-based program design concept, a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms algorithms divide and conquer, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book.... Platform: |
Size: 334848 |
Author:龙飞华 |
Hits:
Description: 数据结构与算法一书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法。-Data structures and algorithms in a brief review of the basic concept of c++ program design, on the basis of comprehensively systematically introduces the queue, stack, tree, graph, such as basic data structures, as well as the greedy algorithm, divide and conquer algorithm, branch and bound algorithm and other algorithms design method. Platform: |
Size: 15923200 |
Author:dotfly |
Hits:
Search - branch and bound c program