搜索资源列表
myAlgorithmExamplesAndExplain
- 都是自己编写的常用算法的事例,本人础作. 里面有:哈密尔顿环,皇后问题,图的着色问题,子集和数问题,树和等价问题,栈的各种用发等.-themselves are prepared by the algorithm commonly used examples, I make foundation. There are : Hamilton Central, Queen's, graphs, and several subsets, trees and equivalence, the
sumofsub
- 子集和数问题，回溯法实现-subset of several problems that back Method
ZJHS
- 这是一个子集和数问题的递归回溯解法.能在TC和VC++6.0上运行.已经加入注释
Subseofseveralquestions
- 子集和数问题 实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树-Subset of several questions on the implementation of the minimum spanning tree implementation plans, the passage of this algorithm can find this chart connecting all points of the minimum spanning tree
SumOfSub
- 给定一个正整数的集合,子集和问题要求在这个正整数集合中,找出其和不超过正整数C的最大和数的子集，且设计的算法是基于近似算法的基本思想。-Given a set of positive integers, a subset of the requirements and problems in this set of positive integers, to find out and no more than the largest positive integer C, a subset of
Subset
- 子集和数问题.rar，用C++写的，可以运行-Subset of several problems. Rar, written in C++, you can run
Subset_Number
- 子集和数问题的回溯算法，C++实现-Subset of the backtracking algorithm and several issues, C++ implementation. . . .
004
- 用蛮力法和回溯法求解子集和数问题，大家可以参考借鉴一下-Use brute force method and backtracking to solve a subset of several issues, we can look for references
suanfashiyan
- 十个算法小程序：二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划（多段图、0-1背包、资源分配问题）、回溯和分支限界法（子集和数问题）-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic pro
zjhs
- 子集和数的问题的c++描述，实现平台visual studio 2008-Subset of several issues that C++ descr iption of the platform Visual Studio 2008