搜索资源列表
Class1
- 用贪婪算法中的哈夫曼编码为文件进行压缩，得到一个比较好的压缩程序．-greedy algorithm with the Huffman encoding of the document for compression, to be a relatively good compression process.
knap
- 用贪婪法的策论，用非递归实现背包问题的求解，并求出放如背包中的物品．-greedy law with political discourse, the use of non - recursive Knapsack Problem Solving and sought release if the items backpack.
贪心算法
- 模式识别中的贪心算法，是根据分配篮球队员的简单条件做的-pattern recognition of greedy algorithm is based on the distribution of basketball players do the simple conditions
8puzzle
- 8数码难题求解,3*3矩阵，输入初始状态和最终状态，编译运行观察运动步骤。-8 digital problem solving, 3* 3 matrix, enter the initial state and final state, the compiler is running observe the movement step.
MiniTetris
- 这是一个贪心蛇的游戏，此游戏是由c#程序写的-This is a greedy snake game, this game is a c# Procedures written
tanchisheyouxi
- 贪吃蛇，就是满足以上要求而设计出来的，希望能给玩家带来娱乐。贪吃蛇这一游戏简单易行，操作方便，娱乐性较强，吸引了不少人。-greedy snake, is designed to meet these requirements, hoping to bring entertainment to players.This greedy snake game simple, easy to operate, entertaining, attract many people.
Five_chess
- 采用c#编程的人机对战的五子棋程序，AI智能采用贪心算法和极大极小值算法，程序有详尽的注释，适合参考-C# programming using the man-machine war of Gobang procedures, AI algorithms and intelligent use of greedy algorithm for max-min value, the program has detailed notes for reference
tanxin
- 算法设计课程设计中的贪心算法，用c++实现代码-Algorithm design in the curriculum design of the greedy algorithm to achieve code
GreedyEat
- 基于C#2008开发的MOBILE小游戏贪吃的家伙。 这是本人初学C#的战利品 在些献给有志从事手机游戏开发的网友-Based on the development of C# 2008 game MOBILE greedy guy. This is my beginner C# in some of the spoils of war dedicated to people interested in the development of mobile game users
cupidity
- 使用visual c++语言编写的贪心算法-Using visual c++ language of the greedy algorithm
c
- 本代码解决的是背包问题之贪婪算法。采用的是C语言源代码-This code is to solve the knapsack problem of the greedy algorithm. Using the C language source code
Prim
- 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characteriz
beibao
- 实验，背包问题贪心算法。使装入背包的物品的价值最大。-Experiments, the greedy algorithm knapsack problem.
cluster
- 实现聚类分析的几种典型算法，包括Greedy、K-Means、FCM、Xie-Beni等。可以对提供的几个数据库文件进行聚类操作，并显示和统计结果的各项数据。程序具有基于C#的图形界面，操作直观方便。-Cluster analysis of several typical algorithms, Greedy, K-Means, FCM, Xie-Beni, etc.. The cluster provides several database files, and display the da
search-the-tree
- 贪心算法对于找零钱的实现，时间效率高，准确，谢谢使用-Greedy algorithm for the realization of looking for change, time efficient, accurate, thanks to use
Back_money
- 贪心算法，找零钱问题 币种有100元、50元、10元、5元、1元、0.5元和0.1元-The greedy algorithm, the change of currency 100 yuan, 50 yuan, 10 yuan, 5 yuan, 1 yuan, 0.5 yuan and 0.1 yuan
The-shortest-path
- 用贪心法和动态规划两种算法求解有向图任意两个节点之间的最短路径，要求给出最短路径的值以及中间路径。-Greedy method and dynamic programming algorithm to solve the two have to figure the shortest path between any two nodes, required to give the value of the shortest path and the middle path.
greedy-algorithm
- 贪心算法，基于C++程序的经典会议安排的算法的实现-greedy algorithm
jiyutulun
- 基于图论的多叉路口相位设计方案 用图论的方法计算出一个多叉路口用信号控制的情况下所需的最优相位个数。至于这种相位个数能不能达到交叉路口的最大通行容量，以及最短的排队时间和排队长度，都不在本文研究的范围之内，因此，未来可以根据本文提供设计的相位个数来研究上述问题。-The intersection is the “bottleneck” of the road network’s traffic capacity and the “Multi-happening” of traffic acc
greedy
- 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。 2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。 3） 将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。 4）背包问题的实验数据如下表：n=8,m=110 -1) programming to implement the knapsack problem greedy algorithm and