Dijkstra算法在停车诱导系统中的应用
n low efficiency and wasting space. It is improved by taking adjacency multilist as the storage structure and altering the time complexity into O（nlog2n）， which has turned out to be more efficient and effective to find out the shortest path in the simulation experiment of real map.Key words： parking guidance system； the shortest path； Dijkstra algorithm； storage structure0 引言停
<<上一页 下一页>>
广州市越秀区图书馆版权所有。
联系电话：020-87673002
本站访问人数：