http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이종현,강민제,이상준 제주대학교 산업기술연구소 2000 尖端技術硏究所論文集 Vol.11 No.2
The shortest path problem arises whenever we try to determine the shortest, cheapest, or most reliable path between one or many pairs of nodes in a network. The path search algorithm for the CNS(Car Navigation System) process the actual road map with complex data and should return the result within acceptable response time. In this paper. we studied the improvement of existing shortest path algorithm using the positioning information. The proposed algorithm was analyzed by the simulation with the real road map data in Jeju city. From the simulation result, it is known that the proposed algorithm required less memory usage and less computational time than the others.