Description: 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.
To Search:
File list (Check if you may need any files):
Arrangement3.dsw
Arrangement3.ncb
Arrangement3.opt
Arrangement3.plg
Arrangement3.cpp
Arrangement3.dsp
Download