计算机技术与发展Issue(12)：59-61,65,4.DOI:10.3969/j.issn.1673-629X.2013.12.014
基于图的最短路径跨域数据交换实现
Realization of Graph-based Cross-domain Data Exchange with Shortest Path
摘要
Abstract
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 confirmed by the realization of the shortest path search of e-government cross-domain data exchange.关键词
跨域/数据交换/最短路径/邻接表/深度优先搜索遍历Key words
cross-domain/data exchange/shortest path/adjacency list/depth-first search分类
信息技术与安全科学引用本文复制引用
王茜,李安颖,葛新,王浩..基于图的最短路径跨域数据交换实现[J].计算机技术与发展,2013,(12):59-61,65,4.基金项目
陕西省自然科学基金(2012JM7017) （2012JM7017）
