Data Structures Final Project - SnowGPS

For our final project for our Data Structures course, my group decided to make a GPS app that finds the path with the minimum time spent outdoors. We wrote a python program to allow us to map our campus as an undirected graph, with vertices at the intersection of every outdoor path, and at every door of every building. To decide paths, it uses Dijkstra’s Algorithm. To achieve our goal of deciding paths with the least time outdoors, we assign weights of 0 to all edges that connect nodes within buildings, and for each other edge the weight is the linear distance between the nodes.