About

This application was created as the main software product of my Independent Study at the College of Wooster. Its purpose is to find meeting places between 3 or more locations. To do this, I created two algorithms one of which is guaranteed to find the best meeting point and another that finds a meeting point that is good enough, but runs faster than the exact method. These algorithms utilizes Dijkstra's single-source shortest path algorithm in order to find meeting places. To learn more about these algorithms, read my IS which is freely accessible at openworks.wooster.edu.
Implemented Features
  • Contact Form
  • Place Markers on the Map
  • Generalized for more than 3 locations
  • Brute Force Meeting-place algorithm
  • Heuristic algorithm which is faster than Brute Force
Future Features
  • Display times to meeting place
  • Display routes to meeting place
  • Enable types of meeting places
  • Create list of meeting places