Street Harassment Project - Data Structures and Algorithms I

Third Delivery Update

Program can now receive custom coordinates and verify if the given coords are in the dataframe of the streets of Medellín.
- Check out customizeCoords() at the "backmethods" file.
Program shows 3 paths by redefining the variable v in 3 different ways with Dijkstra's Algorithm.
- Red path: v = l * r
- Green path: v = l**(2*r)
- Purple path: v = l + (80r)
Added getDistanceOfPath() at the "backmethods" file which give us the total length and average risk of a path.
- Function is being called 3 times to see all the results for each path.

Both technical report and slides for this delivery have been added to the third delivery folder

Code files are divided in 3 files:

backmethods.py
- This file contains all the methods we call in the main file, some of them are:

generateGraph() getCoords() dijkstraShortestSafest()

main.py
- This is the executable file, here we have the main menu inside an infinite loop, which offers us different places to test the algorithm or we can just add the coords that we want to test. You can also quit the program by entering the specific option in the menu.
- We keep calling functions from backmethods.py. and path_map.py.
path_map.py
- This is our file to draw. We use "Folium", a really nice library to draw the 3 paths requested and we added cute markers to the starting point and the destination.