Algorithm Step 1 : Create a set shortPath to store vertices that come in the way of the shortest path tree. Step 2 : Initialize all distance values as INFINITE and assign distance values as 0 for source vertex so that it is picked first. Step 3 : Loop until all vertices of the graph...
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 ...