Function main

CPP/graph_tree/bfs.cpp:41–74

}

int main()
{
    cout<<"Enter Node_";
    cin>>n;
    cout<<"Enter Edges_";
    cin>>m;
    int x,y;
    for(int i=1;i<=m;i++)
    {
        cin>>x;
        cin>>y;
        adjList[x].push_back(y);
    }

    for(int i=1;i<=n;i++)
    {
        cout<<i<<" -->";
        for(int j=0;j<adjList[i].size();j++)
        {
            cout<<adjList[i][j]<<" ";
        }
        cout<<endl;
    }

bfs(1);
for(int i=1;i<=n;i++)
{
    cout<<"\tVertex="<<i;
    cout<<"\tParent="<<parent[i];
    cout<<"\tDistance="<<dist[i];
    cout<<endl;
}
    return 0;
}