首页 | 本学科首页   官方微博 | 高级检索  
     

GIS中最佳遍历分析算法与实现
引用本文:刘小生,余豪峰. GIS中最佳遍历分析算法与实现[J]. 地理空间信息, 2008, 6(1): 10-12
作者姓名:刘小生  余豪峰
作者单位:江西理工大学,江西,赣州,341000
摘    要:首先介绍了地理信息系统(GIS)网络分析的发展概况;其次在已有GIS最佳遍历分析存在问题的基础上,提出了一种最佳多路遍历分析算法。并在ArcEngine环境下,以某县交通网为例,利用C#.net及ArcEngine二次开发类库实现了其最佳多路灾情巡视路线分析。算法适用范围广,可以推广到很多同类的地理网络问题。

关 键 词:地理信息系统  最佳遍历分析  最小生成树  多路灾情巡视分析  ArcEngine二次开发
文章编号:1672-4623(2008)01-0010-03
收稿时间:2007-09-06
修稿时间:2007-09-06

Algorithm and Realization of the Best Ergodic Analysis in GIS
LIU Xiaosheng,YU Haofeng. Algorithm and Realization of the Best Ergodic Analysis in GIS[J]. Geospatial Information, 2008, 6(1): 10-12
Authors:LIU Xiaosheng  YU Haofeng
Affiliation:(Jiangxi University of Science and Technology, Ganzhou 341000, China)
Abstract:This article first introduces the developing state of network analysis of geographic information system (GIS), secondly proposes one kind of analysis algorithm of best multi-path based on problems which exits in the best ergodic analysis in GIS. Under the Arc Engine, take communication networks of some county as example, make use of C#.net and repeated developing of Arc Engine to realize inspecting route analysis of the best multi-path disaster. The algorithm can be used widely and spread to many geographical network problems of the same kind broadly.
Keywords:GIS   the best ergodic analysis   minimum been tree   multi-path disaster inspected to analysis   ArcEngine repeated development
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号