Graph.cpp

#include "Graph.h"

Graph::Graph(int num, bool dir): n(num), hasDir(dir), nodes(num +1) {}

void Graph::addEdge(int src, int dest, int weight) {
    if (src < 1 || src > n || dest < 1 || dest > n) {return;}
    nodes[src].adj.push_back({dest, weight});
    if (!hasDir) {nodes[dest].adj.push_back({src, weight});}
}


list<Flight*> Graph::bfsGetList(int v) {
    // initialize all nodes as unvisited
    for (int v = 1; v <= n; v++) {nodes[v].visited = false;}
    list<Flight*> list1;
    queue<int> q; // queue of unvisited nodes
    q.push(v);
    nodes[v].visited = true;
    int i = 1;
    while (!q.empty ()) { // while there are still unprocessed nodes
        int u = q.front();
        q.pop (); // remove first element of q
        list1.push_back(nodes[u].flight);
        if (i == 1) {
            pair<string, int> p;
            p.first = nodes[u].flight->getSource()->getCode();
            p.second = u;
        }
        for (auto e : nodes[u].adj) {
            int w = e.dest;
            if (!nodes[w].visited) { // new node!
                q.push(w);
                nodes[w].visited = true;
            }
        }
        i++;
    }
    return list1;
}

void Graph::setFlight(int node, Flight* f) {
    nodes[node].flight = f;
}