-
arrangement
假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数。)
对于给定的k 个待安排的活动,编程计算使用最少会场的时间表。
(Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.)
K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)
- 2014-10-22 11:00:45下载
- 积分:1
-
chain
链表的模板类,提供插入删除,遍历器,查找等功能,只有一个头文件,可以包含到你的工程(template implemention of Chain)
- 2013-12-09 11:04:33下载
- 积分:1
-
NoGo
计算机博弈大赛不围棋的代码 个人所写,可以用来参考( U8BA1 u7B97 u673A u535A u5F08 u5927 u8D5B u4E0D u56F4 u68CB u7684 u4EE3 u7801 u4E2A u4EBA u6240 u5199 uFF0C u53EF u4EE5 u7528 u6765 u53C2 u8003)
- 2021-04-04 19:39:04下载
- 积分:1
-
data-structure-paper
本资料为数据结构的相关试卷,可以帮助大家解决一下有关考试的问题(This information is relevant papers data structure that can help you solve the problems concerning the examination)
- 2013-09-18 08:16:24下载
- 积分:1
-
qiuhe
多项式求和,用链表实现的一元多项式求和程序,比较 靠谱(Polynomial sum, with the linked list implementation of a polynomial summation procedure, more reliable)
- 2011-09-15 09:16:38下载
- 积分:1
-
Kruskal
克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
- 2009-06-27 01:43:39下载
- 积分:1
-
a-linked-list-and-related-processing
链表的建立及相关处理,包括排序,删除,初始化,增加,删除等等,且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分:1
-
polynomial
说明: 线性表的基本运算及多项式的算术运算在顺序表泪SeqList 中增加成员函数void Reverse()实现顺序表的逆置
(Linear form the basic arithmetic operations and the polynomial form in order to increase tear SeqList member function void Reverse () to achieve the inverse order of the table set)
- 2010-04-20 20:11:40下载
- 积分:1
-
beipaowenti
背包算法的c++简单实现,很有用的,可以看看(Knapsack algorithm)
- 2012-04-10 19:32:41下载
- 积分:1
-
NewCode
清(英文)常见数据结构,代码实现,值得下载,值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
- 2012-11-21 14:33:49下载
- 积分:1