Based on Graph Coloring Affairs Schedule Algorithm for the Design

The objects convert abstract affairs, proposed algorithm for the affairs scheduling problem based on graph coloring ideas.The link between the affairs established affairs scheduling model, and convert into equivalent graph coloring problem, vertices on graph coloring to achieve the affairs of a scheduling conflict.Compared with general graph coloring approach is different, the nodes are shaded to the thought to achieve affairs scheduling.The algorithm based on graph coloring the design and implementation of more than many affairs issue has been resolved, and conflict affairs executed satisfy needed the special requirements of each element.