摘要
基于闭包的放大和最小性特点来处理离散数学中相关概念,梳理了离散数学中显性和隐性的一些闭包概念,如二元关系的闭包、强分图、子空间、和空间、生成子群等.试图在闭包的框架下将这些概念的教学格式化,操作过程标准化.同时,介绍了作者的教学方案和一些教学技巧,最后将关系传递闭包的思想应用到最短路径及一笔画问题等案例的算法设计中.
We make a thorough inquiry about the concepts in discrete mathematics based on the amplification and minimum features of the closure. We collected some explicit concepts and implicit concepts of closure from discrete mathematics such as closures of binary relation.strong part graph.subspace,sum subspaee,gener- ating subgroup and so on. Trying to format the teaching of these concepts and procedure standardization in the framework of the closure. At the same time, we introduce our teaching programs and techniques. Finally, the thinking of relationship transitive closure is applied to the algorithm design of the shortest path and Euler roads.
出处
《郑州大学学报（工学版）》
CAS
北大核心
2012年第5期133-137,共5页
Journal of Zhengzhou University（Engineering Science）
基金
广东省科技计划资助项目(2010B010600039)
广东省自然科学基金资助项目(S2011010003681)
五邑大学教学团队建设项目
2010年广东省大学生创新实验项目资助
关键词
闭包
二元关系
子空间
无向图
连通图
生成子群
最短路径
closure
binary relation
subspace
undirected graph
connected graph
generating subgroup
shortest path
