Given the source station and the set of destination stations the passenger wants to visit over a month, you are required to use the idea of a minimum spanning tree (but with appropriate modifications) find the minimum-cost travel plan for the passenger, where the cost of
You must also print the total cost of the monthly plan, i.e. the sum of all the monthly train journey costs and the monthly transit costs at all stations where a change of trains happens for some journey.
In case there are multiple monthly plans with the same minimum cost, you can print any one of them.
To compile the planner, please use g++ -g -o planner main.cpp
To debug, please use gdb ./planner on Linux or lldb ./planner on Mac
