Groggo needs coffee as badly as Cameron Whiteside needs a job, and only you can fix that! Each map begins as a weighted graph of 2,450 nodes represented by a 70 x 35 grid. Each pair of orthogonally and diagonally adjacent nodes are joined by an edge with a weight equal to the nodes' Euclidian distance. You can modify edge weights by adding, editing, and removing features. When finding a path, the application generates an adjacency list based on your unique map and animates the node visitation order and shortest path to the coffee shop according to Dijkstra's algorithm.
This project seeks to match like-minded individuals through collaborative surveys whose questions are answered on a scale of 1 to 10. The algorithm rewards patterns among pairs of people who deviate similarly from the average response. Users can view profile information of those with whom they share the highest compatibility.