Skip to content

This repository generates a crime risk grid map based on the crime data file crime_dt.shp. A* Heuristic search algorithm is implemented to find the optimal path by avoiding high crime areas between any two points in the grid (entered by the user).

Notifications You must be signed in to change notification settings

mushfiqur-anik/A-Star-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

A-Star-Algorithm

Description of the problem

In this project a crime risk grid map was generated based on the crime rates data that was provided by the crime_dt.shp file which contains different crime rates data at different part of downtown Montreal. A* Heuristic Search algorithm was used to find the optimal path between any two given points (entered by the user) by avoiding the high crime areas in the grid.

File List

  • CrimeAnalytics.py

Built with

Author(s)

This project is licensed under the MIT License - see the LICENSE file for details

About

This repository generates a crime risk grid map based on the crime data file crime_dt.shp. A* Heuristic search algorithm is implemented to find the optimal path by avoiding high crime areas between any two points in the grid (entered by the user).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages