RouteGraph.h

#ifndef ROUTEGRAPH_H
#define ROUTEGRAPH_H

#include "common.h"
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <map>
#include <set>
#include <iomanip>

using namespace std;

class RouteGraph
{
private:
    // map<Stop Name, List of Edges>
    //  Edge: pair<Destination Stop, pair<Time, Bus Number>>
    map<string, list<pair<string, pair<int, string>>>> adjList;

    // Map for linking normalized names to Capitalised names
    map<string, string> stopNameMap;

public:
    // Adds a single bus stop to the graph.
    void addStop(string stopName);
    // Adds a one-way connection between two stops.
    void addRouteConnection(string stopA, string stopB, int time, string busNumber);
    // shortest path with Dijkstra
    RoutePlan findShortestPath(string startStop, string endStop);
    void printAllStops();

    // Gets the direct travel time between two adjacent stops on a specific bus.
    int getDirectTravelTime(string stopA, string stopB, string busNum);
};

#endif