C++ programming regarding algorithm

Create a C++ program that will solve the following challenge: <[login to view URL]> Find the fastest path through all the underground stations of London. The program must be able to satisfy all condiotions in the above link and present a graphical solution of the answer at minimum. Worst case senario is to provide the solution in a text. The program must be completely functional until 18 June. The code should be commented and references provided for any external code or ideas. ## Deliverables All station data are in the tfl website but if worker accepts the project I will provide all the time costs in excel form. The data provided will be simplyfied removing all stations that are one the same line and taking the cost from initial to final station on that line. When there is a train change an approximate delay of 4 minutes must be added to compensate for the time from platform to platform. This can be done however the worker thinks its best. The picture attached below shows which stations will be neglected in the simpified data.