-
Notifications
You must be signed in to change notification settings - Fork 0
A C Program To Find The Nearest Police Station And Tell The Shortest Route To Reach The Required Location Of A Hypothetical City (Based On Dijkstra's Algorithm)
License
harsh-kashyap0201/NEAREST-POLICE-STATION-FINDER
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
A C Program To Find The Nearest Police Station And Tell The Shortest Route To Reach The Required Location Of A Hypothetical City (Based On Dijkstra's Algorithm) In this project I tried to make code a program which can find nearest police station from a location and tell the shortest path to reach there.I used dijkstra’s algorithm for searching shortest path and distance of that path. I have used an imaginary map of a locality in which there are 9 houses and 3 police stations. This idea can be extended to more number of houses and police stations
About
A C Program To Find The Nearest Police Station And Tell The Shortest Route To Reach The Required Location Of A Hypothetical City (Based On Dijkstra's Algorithm)
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published