Inspiration

We were inspired by various animations and TV shows, in which people often have difficulties finding the shortest path to their dating site. Sometimes this even leads to a tragic end. So, we decided to make an app that calculates the shortest distance between any of the two points among five on a simple map that could facilitate finding your way to your love!

What it does

It helps find the minimum distance, thus the quickest path, to your dating site from your starting point, in pixel units. By simply clicking on the checkboxes corresponding to two sites, the shortest distance will be calculated and the sequence of locations will be given to you.

How we built it

We used the simulated annealing algorithm to continuously randomize the path between any two nodes (points) until the shortest one has been reached. This algorithm can also be optimized with more runnings. We coded the user interface with streamlit, and connected the algorithm to the streamlit codes. After testing and debugging, the app is done.

Challenges we ran into

The biggest challenges we ran into are to run streamlit on our computer because we didn’t know how to and to combine the algorithm written in C++ and the streamlit user interface written in Python. We eventually solved both of them.

Accomplishments that we're proud of

The biggest accomplishment we are proud of is learning how to use streamlit and learning about an algorithm. We are also proud that we are able to translate one of the programming languages (C++) into another (Python) so as to combine the code snippets.

What we learned

As stated above, we learned streamlit, how to run it, the simulated annealing algorithm, some code translation, code combination and debugging. As beginners, we really learned a lot during this first hackathon we attended.

What's next for Quickly Find Your Love

In the future, we will improve the codes and debug more to allow users to click on several destinations at once, and incorporate a bigger map. We also aim to give distance in actual units like meters or kilometers and avoid obstacles along the way.

Built With

Share this project:

Updates