Trip Planer

Challenges

1. Determine the most efficient way to determine the cheapest price to travel from a city to another
2. Understanding the best data structure to be used to ensure efficiency of the program
3. Understand Dijkstra's algorithm and adapt it to the current problem to provide the required solution

About

This program was developed for academic purposes and learning the traversal of graphs using Breadth First Search Algorithms. Understanding how greedy algorithms work and the pros and cons when implementing.

Technical

Programming language: C++

Requirements

Windows, Linux, macOS

Contributors

Kidjou Chang