A new method of representing graph projections in computer memory is proposed, which is more informative than matrix and list data structures based on elementary relations of vertices adjacency or edge incidences. The class of graphs considered in this study is expanded to include mixed graphs containing both undirected and directed edges (arcs). A new method for searching the shortest routes based on this approach is also proposed. The results of the general and special (for compact graphs) analysis of the asymptotic complexity of this method in solving typical SPP problems (Shortest Path Problem) show that the developed method is highly efficient and will find its application not only in information networks, where there are particularly high requirements for the topology of computing systems and the efficiency of finding shortest routes, but also in other scientific, technical, transport and economic fields.

翻译：本文提出了一种新的图投影在计算机内存中的表示方法，该方法基于顶点邻接或边关联的基本关系，相比矩阵和列表数据结构信息量更丰富。本研究将所考虑的图类扩展至包含无向边和有向边（弧）的混合图。同时基于该方法提出了一种新的最短路径搜索算法。通过对该方法在求解典型最短路径问题（SPP）时的渐进复杂度进行一般性分析及专门（针对紧凑图）分析，结果表明所开发方法具有高效性，不仅适用于对计算系统拓扑结构和最短路径搜索效率有极高要求的信息网络，还可在其他科学、技术、交通和经济领域得到应用。