C+ programming

This practical work (PW) is the first in a series of 3 PWs related to the data of Quebec City
Transportation Network (hereafter referred to as RTC, standing for “Réseau de transport de la
Capitale”). The goal of the PW2 will be to implement the algorithms and the data structures that will
allow you to get the fastest itinerary of a trip (using the RTC) to travel from any location to any other
location. To achieve this, in this PW1, you will need to implement the “DonneesGTFS” (Gtfsdata)
class, whose purpose is to manage the access to rtc’s gtfs data.
To be able to do what is asked in the
PW1, you will have to use the standard STL containers, such as the vector, the set, the map, the
multimap, and the unordered_set. The goal of this PW is therefore to enable you to familiarize yourself
with the use of these containers, so that you can use them correctly and efficiently in the future.