文件名称:huichang
介绍说明--下载内容均来自于网络,请自行研究使用
假设要在足够多的会场里安排一批活动,并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点,不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数,相应于要找的最小会场数-Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as possible. The design of an effective arrangement of the greedy algorithm. ( this problem is actually the famous graph coloring problem. If every activity as a graph is a vertex, edge connected between incompatible activities. So that adjacent vertices with different colors corresponding to the least number of colors, to find the minimum number of venue
(系统自动生成,下载前可以参看下载内容)
下载文件列表
huichang.doc