搜索资源列表
id5
- 介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and
subset
- 用回朔算法解决子集和问题 输出整数集的所有子集，使子集的各元素之和为S-Schomburg algorithm used to solve the problem and the subset of output Integer Set subset of all, the subset of the elements and as S
子集和问题
- 子集和问题.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,
药效团计算源代码
- 本程序可以根据输入的分子集进行自动训练，找到药效团分子的训练集和测试集。 内附源代码。
ASN.1/BER/DER 编码子集入门指南
- 本文简单介绍了OSI 抽象语法符号（ASN.1）的子集——基本编码规则（BER）和可辨别编码规则（DER）。本文的主要目的是为理解和实现PKCS协议族提供足够的背景材料。
递归输出全排列和集合的所有子集
- 递归实验，用递归输出全排列和集合的所有子集
sumofsub
- 子集和数问题，回溯法实现-subset of several problems that back Method
子集和问题
- 子集和问题.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,
集合的交并差运算
- 演示执行集合的并,交,差运算,是以有序链表表示集合.判定子集,求补运算也实现了.-demonstration and implementation of the pool, intersection, difference, computation, is set in an orderly Chain said. Convicted subset, seeking fill operation has been achieved.
id5
- 介绍动态规划方法在解决背包问题、图象压缩、矩阵乘法链、最短路径、无交叉子集和元件折叠等方面的应用。-on dynamic programming methods in solving knapsack problem, image compression, the matrix multiplication chains, the shortest path, non-overlapping subsets of folding and
subset
- 用回朔算法解决子集和问题 输出整数集的所有子集，使子集的各元素之和为S-Schomburg algorithm used to solve the problem and the subset of output Integer Set subset of all, the subset of the elements and as S
C0Compiler
- 自己写的一个C子集的编译程序，包括源码和说明文件，以及文法的扩充BNF表达式-himself wrote a subset of the C compiler, including source code and documentation, and the expansion of BNF grammar expression
subset
- 利用回溯法求解子集和问题的C++实现 给定正整数集合S和正整数c计算出子集和s1使得子集合之和为c-The use of retrospective method and problems in a subset of the C++ Achieve a given positive integer set S and positive integer c calculated subset and makes a subset o
pl0
- 编译方法实验根据编译器的工作过程，分为以下三个部分 词法分析 语法分析 语义分析和代码生成 三部分之间互相关联，最终完成三个实验后，就实现了C- -言（C++语言的子集）或PL0语言的编译器。 -Methods compiled in accordance with the work of the compiler process, divided into the following three-pa
subset
- 子集和问题的一个实例（s，t).其中s是一个正整数集合，t是一个正整数。子集和问题判断是否存在s中的一个子集s1，使得s1的和等于t-And problems in a subset of an instance (s, t). Which is a positive integer s collection, t is a positive integer. Subset and to determine whether proble
subSetSum
- 说明:子集和问题 给定一个n个整数的集合X = {x1, x2, …, xn}和整数Y，找出和等于Y的X的子集subX。 比如说，如果X ={10,20,30,40,50,60} 和 Y = 60 则有三种不同长度的解，它们分别是 subY = {10，20，30}，{20，40} 和{60} 使用回溯法实现.开发VS2005工具-Descr iption: a subset of the problem and g
subsum
- 回溯法求子集和问题, 在回溯过程中利用了剪枝 -The back track method to solve the sub sum problem
subsetSum
- 输入集合个数及相应集合，指定子集和，然后回溯求解所有可能组合。-Enter the collection number and the corresponding collection and specify a subset, and then go back to solve all the possible combinations.
004
- 用蛮力法和回溯法求解子集和数问题，大家可以参考借鉴一下-Use brute force method and backtracking to solve a subset of several issues, we can look for references
Subsets
- 数据输入：由文件input.txt提供输入的数据。文件第一行有2个正整数n和c，n表示S的大小，c是子集和的目标值。接下来的1行中，有n个正整数，表示集合S中的元素。 结果输出：将子集和问题的解输出到文件output.txt。当问题无解时，输出“No Solution”。(Data Entry: The input data provided by the file input.txt. The first line of the f