搜索资源列表
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版
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
Myjava
- 实现了《算法设计与分析》的一次课后题，有兴趣的可以看着玩。java代码，在eclipse上可以直接运行。-The realization of the Design and Analysis of Algorithms, an after-school title, interested can watch online. java code, in the eclipse can be directly run.
Java_doc
- 进程调度的设计与实现，各个调度算法的比较与分析，提出自己的看法并通过计算机模拟实现-The process of scheduling the design and realization of various scheduling algorithms of comparison and analysis, put forward their own views and, through computer simulation to achieve
MergeSortcode
- 合并排序 算法设计与分析 Java实现 配合算法设计与分析 第二版-Merge Sort Algorithm Design and Analysis of Java implementation
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
opp
- 系统分析与设计算法,Java简单的系统编程，多对一的应用以及设计。-Systems Analysis and Design Methods
n-queen-problem-display
- n后问题演示程序，算法分析与设计，递归算法-N queen problem demonstration program, the algorithm analysis and design, recursion algorithm
queen
- 算法设计与分析 java n后问题源码 王晓东书版本上的课堂练习的完整代码-Classroom exercises after the the problem source Wang Xiaodong book version of the complete code for the algorithm design and analysis of java n
Coloring
- 算法设计与分析 王晓东版本 采用java编写 图的m着色问题完整代码-M coloring problem complete code written using java graph algorithm design and analysis Wang Xiaodong version
Loading-Java-code
- 计算机算法设计与分析中的装载问题，实现装载问题的最优解。-Loading the design and analysis of computer algorithms, to achieve the optimal loading problem solution.
Huffmm
- java语言实现哈夫曼编码的过程，算法设计与分析课程中一个重要的算法源代码-Process java language Huffman coding, algorithm design and analysis course is an important algorithm source code