Description: acm algorithm design- the venue arrangements! Assume it to be enough room in the arrangements in 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 issue is well-known graph coloring problem. If each activity as a graph vertex, between the incompatible activities connected with edges. So that adjacent vertices have different colors of coloring the smallest number, which corresponds to looking for the smallest number of the venue.) k for a given month to be arranged activities, calculated using the programming schedule for the venue at least.
File list (Check if you may need any files):
Lecture Halls
.............\Debug
.............\.....\Lecture Halls.exe
.............\.....\Lecture Halls.ilk
.............\.....\Lecture Halls.obj
.............\.....\Lecture Halls.pch
.............\.....\Lecture Halls.pdb
.............\.....\StdAfx.obj
.............\.....\vc60.idb
.............\.....\vc60.pdb
.............\Lecture Halls.cpp
.............\Lecture Halls.dsp
.............\Lecture Halls.dsw
.............\Lecture Halls.ncb
.............\Lecture Halls.opt
.............\Lecture Halls.plg
.............\ReadMe.txt
.............\StdAfx.cpp
.............\StdAfx.h
Download