0% found this document useful (0 votes)
12 views2 pages

Safe Path Finder

The Safe Path Finder project aims to develop a navigation system that identifies the safest routes between locations using real-time crime data and notifies emergency contacts. It utilizes a modified Dijkstra’s algorithm to calculate paths based on crime statistics, enhancing urban navigation and public safety. The project demonstrates the integration of graph theory and external data into practical applications.

Uploaded by

yavetix657
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views2 pages

Safe Path Finder

The Safe Path Finder project aims to develop a navigation system that identifies the safest routes between locations using real-time crime data and notifies emergency contacts. It utilizes a modified Dijkstra’s algorithm to calculate paths based on crime statistics, enhancing urban navigation and public safety. The project demonstrates the integration of graph theory and external data into practical applications.

Uploaded by

yavetix657
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment Report

Date: 17-04-2025

Assignment No: 13

Title: Safe Path Finder

Problem Definition

To develop a safe path navigation system that calculates the safest route between two
locations by considering recent crime statistics and automatically notifies emergency
contacts of the user’s location.

Learning Objective

• Understand how real-time crime data can be integrated into navigation systems.
• Learn to implement graph algorithms like Dijkstra’s algorithm to find the safest
routes.
• Gain practical knowledge of integrating geospatial data and crime analysis into
real-world applications.

Learning Outcome

• Ability to apply graph theory to real-world routing problems.


• Understanding of the significance of safety factors in navigation systems.
• Skill to integrate external real-time data (crime statistics) into navigation
algorithms.

Software and Hardware Requirements


Software:
- Operating System: Windows / Linux
- Programming Language: C++
- Compiler: GCC / G++

Hardware:
- Processor: Minimum Dual Core
- RAM: 2GB or higher
- Storage: 100MB free space
Theory

The Safe Path Finder project leverages real-time crime data to identify and navigate the
safest routes. It uses a modified Dijkstra’s algorithm to compute the safest path by
factoring in crime statistics. A graph representation of the city is created, where nodes
represent intersections, and edges represent roads with safety weights based on crime
data. The system also provides users with emergency notifications of their location.

Algorithm / Pseudocode

1. Input Data:
a. Crime data (latitudes, longitudes, severity)
b. Start and end location (user input)
2. Graph Creation:
a. Create a graph with intersections as nodes and roads as edges.
b. Assign weights to edges based on crime data.
3. Modified Dijkstra’s Algorithm:
a. Use Dijkstra’s algorithm to find the shortest path, considering the crime
severity of each edge (road).
b. The algorithm returns the path with the lowest total crime weight.
4. Emergency Notification:
a. Send real-time notifications to the user’s emergency contacts with their
updated location.

Test Cases
Test Start
End Location Crime Data Expected Output
Case Location
"Intersection "Intersection Path with lowest crime
1 High Crime Areas
A" B" points
"Intersection "Intersection Moderate Crime Safe route with lower crime
2
C" D" Areas intensity
"Intersection "Intersection Safe route with minimal
3 Low Crime Areas
X" Y" alerts

Conclusion

The Safe Path Finder project demonstrates the use of graph algorithms in real-time,
safety-based routing systems. By integrating crime data with Dijkstra’s algorithm, it
helps users avoid high-risk areas for a safer journey. This project highlights the power of
data structures and real-time data integration to enhance urban navigation and public
safety.

You might also like