It also optimizes the algorithm by applying Adjacency List as the data storage structure after analysing the algorithm.
通过对Dijkstra算法数据存储结构进行分析,选择邻接表作为网格点的存储结构,有效的避免了权值为无穷大的无效点,降低了算法的空间复杂度。
参考来源 - 基于Dijkstra的自动布线算法的优化及其应用研究·2,447,543篇论文数据，部分数据来源于NoteExpress
以上来源于: WordNet
The formation and structural features of adjacency list are described.
介绍了邻接表的形成方法和结构特点。
The formation and structural features of adjacency list are described.
这台仪器的特点是结构精巧，携带方便。
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
详细地论述了基于邻接表图形数据结构的进路搜索算法，并给出了完整的描述。
应用推荐