%0 Journal Article
%T New algorithm of shortest path extraction based on complex road network<br>一种面向城市复杂路网最短路径提取的定向收敛算法*
%A LIU Gang
%A LI Yong-shu
%A <br>刘刚
%A 李永树
%J 计算机应用研究
%D 2011
%I 
%X For the purpose of enhancing the efficiency of the shortest path extraction based complex urban road network,considering the characteristics of large data and complex layout in urban road network,this paper studied the distribution of the shortest path between nodes,and proposed orientation convergent algorithm towards the rapid extraction of the shortest path in urban road network concerning the convergent node.The experiments validates the algorithm through a city's traffic networks.In comparison with the...
%K urban road network
%K the shortest path
%K convergent node
%K orientation convergent algorithem<br>城市路网
%K 最短路径
%K 收敛点
%K 定向收敛算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=2A87A593DAC9EF18BA1852CC9E688DC9&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=B31275AF3241DB2D&sid=F43C60BA2AEFF068&eid=E213125423CD99CD&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=11