Description
In this lab, we will take forward the task that we started in Lab 9, i.e. to help passengers plan their journeys. In Lab 9, we considered only direct journeys from a source station to a destination station. In this lab, we will allow journeys with change of trains.
Use Depth-First-Search/Breadth-First-Search or even a Best-First Search (that uses a priority queue instead of a stack or queue to store unexplored nodes) to print journeys from a source station to a destination station, with a specified maximum number of stop-overs and a specified maximum transit waiting time during any of the stop-overs.
Please submit only printJourney.cpp and assumptions.txt in a tar zipped folder named <roll_number>_L10
