搜索资源列表
javaTANXINFABEIBAO
- 用JAVA编写的关于算法分析与设计里的如何用JAVA实现关于贪心法的背包问题,简单明了.有很强的实例意义.-with JAVA prepared by the analysis of the algorithm and the designing of how to use JAVA of greedy law backpack , simple and clear. a strong example of significance.
sell
- 旅行售货员算法分析与设计第六章例题实现与大家共享
line
- 布线问题算法分析与设计实现程序JAVA版
suanfashiyanbaogao
- 算法分析与设计的实验报告，大二的下学期貌似，学习的，希望大家用得着
算法分析与设计课件
- 算法分析与设计课件,不错的讲义-algorithm analysis and design of courseware, yes handouts
CPair
- 分治法寻找最接近点对,内附测试文件，算法分析与设计作业-Partition method to find the most close point ，Enclosed test files, the algorithm analysis and design work
ChessBoard
- 棋盘覆盖问题,java描述求解算法，算法分析与设计-Board cover problem, java solving algorithm descr iption, algorithm analysis and design
mergeSort
- mergeSort,合并排序，算法分析与设计-mergeSort
MaxClique
- 算法分析与设计中的最大团问题，程序给出了详细的说明，下载可以直接运行-Algorithm analysis and design of the maximum clique problem, the program gives a detailed descr iption, download can be run directly
ChessBoardCover
- 经典的算法分析与设计课程中的棋盘覆盖问题，java代码，具有很高的参考价值-Classical algorithm analysis and design course covering the board, java code, with a high reference value
dongtaiguihua
- 算法分析与设计例子：可以完整运行+详细说明：若给定n个整数组成的序列a1，a2，a3，……an，求该序列形如ai＋ai＋1＋……＋an的最大值。-Examples of Algorithm Analysis and Design: You can run+ full details: If a given sequence of n integers a1, a2, a3, ... ... an, find the sequence of the form ai+ ai+1+ ... ...+
bigTuan
- 算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。 无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的 子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirect
NearestPoint
- 算法分析与设计经典问题，用分治法求最近点对，并与蛮力法做对比-Classical algorithm analysis and design problems with the divide and conquer method for the last point, and compared with the brute force method to do
n-queen-problem-display
- n后问题演示程序，算法分析与设计，递归算法-N queen problem demonstration program, the algorithm analysis and design, recursion algorithm
The-longest-public-son-sequence
- 最长公共子序列演示程序，算法分析与设计，动态规划算法-The longest public son sequence demo, the algorithm analysis and design, dynamic programming algorithm
Queen
- 算法分析与设计 用回溯法实现n皇后问题(java源码)-Algorithm Analysis and Design N-queens Problem Using Backtracking
IntegerMultiply
- 算法分析与设计 用递归分治算法解决大整数乘积问题（java源码）-Algorithm Analysis and Design Recursive divide and conquer algorithm to solve the problem of large integer multiplication. (Java source code)
MatrixMultiply
- 算法分析与设计 用动态规划法计算矩阵乘积（java源码）-Algorithm Analysis and Design Matrix Multiply with Dynamic Programming Method. (Java source code)
Subset
- 算法分析与设计 用回溯法解决子集合问题（java源码）-Algorithm Analysis and Design Subset Issues with Backtracking. (Java source code)
DivideConquer
- 2010年05月 算法分析与设计大作业 算法效能比较程序【DivideConquer】-May 2010 algorithm analysis and design of large operations algorithm performance comparison procedures [DivideConquer]