基于图的最短路径跨域数据交换实现  

Realization of Graph- based Cross- domain Data Exchange with Shortest Path

作　　者：王茜 李安颖 葛新 王浩 

机构地区：[1]西安未来国际信息股份有限公司,陕西西安710063

出　　处：《计算机技术与发展》2013年第12期59-61,65,共4页Computer Technology and Development

基　　金：陕西省自然科学基金(2012JM7017)

摘　　要：最短路径查找的效率决定了跨域数据交换的效率。针对通道较少(en(n-1))的跨域数据交换最短路径查找的问题,文中实现了一种基于图的最短路径查找方法。设计了域标识模型、域表和通道表,建立了域表与通道表的关系模型,根据面向对象的方法基于邻接表存储结构构造了域及通道的邻接表。基于深度优先搜索遍历原理,定义邻接表对象、路径集合,记录域访问历史、路径长度,以递归的方式实现了跨域最短路径的查找。实现了电子政务跨域数据交换时域间最短路径的查找,证实了文中方法的有效性。The efficiency of the shortest path searching determines the efficiency of cross-domain data exchanging. For the problem of the shortest path searching of cross-domain data exchange with fewer channels （ e 〈 〈 n（ n - 1 ） ）, a graph-based shortest path searching method is proposed. According to the object oriented approach,after the design of domain identification model ,domain table,channel ta- ble, the establishment of the relationship model between the domain table and channel table, domain and the channel adjacency list are constructed based on the adjacency list storage structure. Based on the depth-first search principle,adjacent list object and path set are de- fined, domain access history and the length of path are recorded, and cross-domain shortest path search method is achieved in a recursive way. The effectiveness of the proposed method is confLrmed by the realization of the shortest path search of e-government cross-domain data exchange.

关 键 词：跨域 数据交换 最短路径 邻接表 深度优先搜索遍历 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]