关键词: 复杂网络图, 确定轨迹, 直接邻边, 间接邻边, 空间存储结构, 最短路径算法

Abstract: The complex networking graph was studied to solve the shortest-path problem with definite track. The concept of direct/indirect adjacent edges was proposed which extended the concept of path to that of line and improved the storage of the adjacency matrix of the simple graph. The space storage structure was used to store the complex networking graph based on the concept of the direct/indirect adjacent edges. The shortest-path algorithm was designed, which used the public transportation search as the example. The theoretical analysis and experimental results show that this algorithm is better than Dijkstra algorithm in terms of time and space.

Key words: complex networking graph, definite track, direct adjacent edge, indirect adjacent edge, space storage structure, shortest-path algorithm