Shortest Pth Uisng Bfs in Graph

shortest.cpp

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){
        V = v;
        l = new vector<int>[V];
    }
    void addEdge(int x, int y, bool undir=true){
        l[x].push_back(y);
        if(undir)
            l[y].push_back(x);
    }
    void bfs(int src, int v, int dest=-1){
        queue<int> q;
        vector<bool> visted(v, false);
        vector<int> parent(v, 0);
        q.push(src);
        parent[src] = src;
        while(!q.empty()){
            int val = q.front();
            q.pop();
            for(auto node : l[val]){
                if(!visted[node]){
                    visted[node]=true;
                    q.push(node);
                    parent[node] = val;
                }
            }
        }
    if(dest!=-1){
        int temp = dest;
        while(temp!=src){
            cout<<temp<<" ";
            temp = parent[temp];
        }
        cout<<src<<" ";
        cout<<endl;
    }
    }
};

int main(){
    Graph g(6);
    g.addEdge(0, 1);
    g.addEdge(1, 2);
    g.addEdge(2, 4);
    g.addEdge(4, 5);
    g.addEdge(0, 3);
    g.addEdge(3, 5);
    g.bfs(0, 5, 5);
}