The present work aims to generate an alternative solution to the current problem of street harassment, a form of sexual harassment that generally occurs in a public space and in which women are mainly affected. To prevent street harassment, the idea is to design a program capable of showing the best route from one point to another in terms of avoiding street harassment and considering the distance between the two points, this two terms multiplied are the weights in our graph since all the weights in our graph are positive. Dijkstra was considered the best fit for our project. It is an algorithm specifically designed to find the shortest path between two vertices in a weighted graph. Not only it does what we need but also it is well known as a fairly low time complexity algorithm.