An Improved Graph-Based Depth-First Algorithm and Dijkstra Algorithm Program of Police Patrol

Article Preview

Abstract:

The urban road network is abstracted as a directed graph in this paper,according to the theory of graph theory. It uses depth-first traversal algorithm of graph,and combining with Dijkstra shortest path algorithm,futhermore ,these two algorithms are improved,so that , the model of this regional division are built which on city roads for patrol’s police Alarm practical speed and distance as the verification conditions,we propose an efficient program for the city police patrol.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

4135-4141

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] HongWei. There is problems and reform in Chinese police patrol service . Yunnan Police Officer Academy (2008)06-28-04 1672-6057.

Google Scholar

[2] Weimin Yan, Weimin Wu. Data structure (C-language version)BeiJing P.R. China.: Tsinghua University Press, 2002(9).

Google Scholar

[3] Qizong Yan. Operations research and optimization method[M]. BeiJing P.R. China.: Machinery Industry Press, (2003).

Google Scholar

[4] Zhihe Wang, YunLing. Dijkstra shortest path algorithm optimization and realization [J]. Software Space, 2007,23(11):275-277.

Google Scholar

[5] JiaMing Xu. Research on the key Technologies of Patrelling Important Objeets & System RealiZation. Hangzhou P.R. China. ZheJiang University. March, (2003).

Google Scholar

[6] Yang Liu, Yuhua Zhao, Xiaozhuang Zhou, Guoxiong Peng, Meiping Yun. Optimization Algorithm of Vehicle Patrol Problem Based on Hamilton Loop . Computer Engineering. 000-3428(2007)ll-0013-02.

Google Scholar

[7] http: /www. mathworks. com/products/matlab/books. html.

Google Scholar

[8] http: /www. mathworks. com/support/books.

Google Scholar