Inspiration

We have gotten lost in Lafferre many times before

What it does

It gives directions from one classroom to another in the first floor of Lafferre.

How we built it

We got used Djikstra's algorithm to find the best path, and then we converted a map of Lafferre to adjacency lists as input.

Challenges we ran into

Lafferre is a very big building with hundreds of rooms, so converting it into adjacency lists was no easy task. Our map of the first floor has over 100 nodes.

Accomplishments that we're proud of

Once we finished inputting the adjacency lists, we had only a couple small bugs before the program as a whole was functional.

What we learned

We learned to start with a small version of your problem and then scale up.

What's next for Directions for Lafferre

We have plans to add the other floors of Lafferre to make it a fully functional way of getting anywhere in the building in the most efficient route.

Built With

Share this project:

Updates