基于“比赛项目图”的运动会秩序册排重算法探讨  

Discussion on the removal duplication algorithm of game program based on game events map

作　　者：罗昌状[1] 麦海娟[2] 

机构地区：[1]宁夏大学物理电气信息学院,宁夏银川750021 [2]北方民族大学商学院,宁夏银川750021

出　　处：《宁夏工程技术》2012年第2期140-144,共5页Ningxia Engineering Technology

摘　　要：为了解决在体育界中一直存在的场地冲突和时间冲突问题,以图论着色原理为理论基础,从构造"比赛项目图"出发,阐述了改进邻接矩阵存储形式,采用分行及多表形式存储保存"比赛项目图"的方法,并给出了解决运动会"秩序册"中排重问题的一种算法.该算法设计将排重操作转化为数据库表的操作,具有简洁、独特、实用等特点,且便于用SQL结构化查询实现.实践证明,该算法具有很好的使用和推广价值.To solute the conflict problem of field and time which always exists in sports game program arrangement,a kind of removal duplication algorithm is brought forward.It based on the graph-coloring theory and beginning with the construction of game events map,and the method of saving game events map by improving adjacency matrix storage form which has multirow and multi-table.The algorithm converts removal duplication operation to database operation with brief,unique and practical chrematistics,and it is easy to use in SQL.Practice proved that the algorithm has a good use and promotion of value.

关 键 词：比赛项目图 邻接矩阵存储 运动会秩序册 排重算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]