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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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



    Published in:

    Advanced Materials Research ; 433-440 ; 4135-4141


    Publication date :

    2012-01-03


    Size :

    7 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Vision Based Indoor Surveillance Patrol Robot Using Extended Dijkstra Algorithm in Path Planning

    Choon Kiat Teh / Wai Kit Wong / Thu Soe Min | DOAJ | 2021

    Free access

    Online car-hailing scheduling method based on improved Dijkstra algorithm

    ZHANG JIN / HONG ANDING / LIU XIANFENG et al. | European Patent Office | 2021

    Free access

    Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması

    Dhulkefl, Elaf / Durdu, Akif / Terzi̇oğlu, Hakan | BASE | 2020

    Free access

    AIS Based Shipping Routes Using the Dijkstra Algorithm

    Pedro Silveira / Ângelo Palos Teixeira / Carlos Guedes Soares | DOAJ | 2019

    Free access