pathfinding Project

The pathfinding project is a project that uses shortest path algorithms to locate the fastest distance between nodes. This program shows and models real world shortest path algorithms in action!

Comment

Inspiration

This program was inspired by shortest path videos that I watched on a youtube channel called computerphile. They went into the advanced concepts that govern shortest path algorithms, how they work, and their real world applications.

What it does

This project takes a two nodes, and connects them via the shortest path depending on which algorithm of your choice. View the full read.me file about the project below on my GitHub page, as well as the tutorial on the github.io site I created for it.

How we built it

I built it with advanced code that mimics these sorting algorithms over a grid to return the shortest path. This project needed CSS and java for the backend, and HTML for the UI.

Challenges we ran into

I ran into quite a few challenges in the beginning as I had no way of knowing where to start. However, once I figured that out, it was almost smooth sailing. Creating the github.io site was new to me and stressful, but I eventually figured it out!

Accomplishments that we're proud of

I am incredibly proud of how it turned out as a whole. This is by far my favorite project and I am super excited to see what other applications I can use with this. I am so happy I was able to get this done!

What we learned

I learned a great deal about how shortest path algorithms are used in the real world, for food deliveries, shipping companies, maps, etc. It was an incredibly insightful experience and I am glad to have been able to learn about an important topic and be able to create something relevant to this.

What's next for pathfinding Project

I am not too sure. All I know is that it will be big!

Built With

Share this project:

Updates