道路网图中禁行信息表达简化  

Simplification of Forbidden Roads of A Graph

作　　者：周猛[1] 徐赐文[1] 鄂丽丽[1] 

机构地区：[1]中央民族大学理学院,北京100081

出　　处：《中央民族大学学报（自然科学版）》2008年第3期52-56,共5页Journal of Minzu University of China(Natural Sciences Edition)

基　　金：国家自然科学基金(No.10471148);中央民族大学"十五"重点科研项目资助

摘　　要：简化连通图上禁行信息的表达有很高的应用价值.本文分析了简化的原则并给出算法,将图中全部连通序列依据限制信息分为三类:必须通行,有条件禁行,可以禁行(其他).通过序列的提取、比较等计算,实现用较简练的子序列集替代S1,实现禁行信息表达的简化.In this paper, we discuss the method and principle of finding the small set of forbidden roads. We classified the roads as pass roads, forbidden roads and other roads. Get the small set by split road and compare them. We try to offer a algorithm： 1 Find the pass roads and forbidden roads, use them as the precondition; 2 Split every road, find the parts that could be used under the precondition, and record those roads the part could replace; 3 Choose the best parts, insert into a new set.

关 键 词：GDF 导航 禁止通行 简化 

分 类 号：O244[理学—计算数学]