Inspiration

Algorithms and flights.

What it does

Allows user to input specific flights and find the cheapest cost from point A to point B

How I built it

Uses dijkstra algorithm in java with a Adjacency List, and Floyd Warshall in c# with a adjacency matrix.

Challenges I ran into

Converting Java to C#.

Accomplishments that I'm proud of

Converting Java to C#.

What I learned

How algorithms such as these ones are useful in the real world.

What's next for AirCheap

Ability to choose specific cities, scripting to get information online, and optimizing the design to be user friendly.

Built With

Share this project:
×

Updates