Scribd Logo
Upload

Welcome to Scribd!

  • Message

    Uploaded by

    arihant garg
    1 views3 pages
    The document implements a breadth-first search (BFS) algorithm to find the shortest path between a source and target node in a graph, while avoiding nodes marked as "cursed". It takes in the number of nodes and edges, the source and target nodes, adjacency lists representing the graph edges, and a vector indicating which nodes are cursed. It performs a BFS starting from the source, keeping track of distances and visited nodes, and outputs the distance to the target or -1 if no path exists.

    Original Description:

    Fkodpsos lslsos

    Original Title

    message

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document implements a breadth-first search (BFS) algorithm to find the shortest path between a source and target node in a graph, while avoiding nodes marked as "cursed". It takes in the number of nodes and edges, the source and target nodes, adjacency lists representing the graph edges, and a vector indicating which nodes are cursed. It performs a BFS starting from the source, keeping track of distances and visited nodes, and outputs the distance to the target or -1 if no path exists.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    1 views3 pages

    Message

    Uploaded by

    arihant garg
    The document implements a breadth-first search (BFS) algorithm to find the shortest path between a source and target node in a graph, while avoiding nodes marked as "cursed". It takes in the number of nodes and edges, the source and target nodes, adjacency lists representing the graph edges, and a vector indicating which nodes are cursed. It performs a BFS starting from the source, keeping track of distances and visited nodes, and outputs the distance to the target or -1 if no path exists.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 3

    #include <iostream>

    #include<algorithm>
    #include<set>
    #include<vector>
    #include<queue>
    using namespace std;

    int main () {

    int n;
    cin >> n;
    int m ;
    cin >> m;

    vector <int> adj[n];

    int src;
    cin >> src;
    int tar;
    cin >> tar;

    vector <int> cursed (n);


    for( int i = 1 ; i <= n ; i++){
    int x;
    cin >> x;
    cursed.push_back(x);
    }

    for( int j =0 ; j < m ; j++) {


    int w;
    cin >> w;
    int r;
    cin >> r;
    adj[w].push_back(r);
    adj[r].push_back(w);
    }

    queue <int> q;
    vector <bool> visited ( n+1 , false);
    vector<int> dis( n+1 , 0);

    q.push(src);
    visited[src] = true;
    dis[src] = 0;
    while( !q.empty() ) {
    int u = q.front();
    q.pop();

    for (int i = 0; i < adj[u].size(); i++) {


    if (visited[adj[u][i]] == false && cursed[adj[u][i]] != 1) {
    visited[adj[u][i]] = true;
    dis[adj[u][i]] = dis[u] + 1;
    q.push(adj[u][i]);

    // We stop BFS when we find


    // destination.
    if (adj[u][i] == tar)
    cout << dis[tar] << endl;
    }

    }
    }

    if( dis[tar] == 0){


    cout << -1 << endl;
    }

    }#include <iostream>
    #include<algorithm>
    #include<set>
    #include<vector>
    #include<queue>
    using namespace std;

    int main () {

    int n;
    cin >> n;
    int m ;
    cin >> m;

    vector <int> adj[n];

    int src;
    cin >> src;
    int tar;
    cin >> tar;

    vector <int> cursed (n);


    for( int i = 1 ; i <= n ; i++){
    int x;
    cin >> x;
    cursed.push_back(x);
    }

    for( int j =0 ; j < m ; j++) {


    int w;
    cin >> w;
    int r;
    cin >> r;
    adj[w].push_back(r);
    adj[r].push_back(w);
    }

    queue <int> q;
    vector <bool> visited ( n+1 , false);
    vector<int> dis( n+1 , 0);

    q.push(src);
    visited[src] = true;
    dis[src] = 0;
    while( !q.empty() ) {
    int u = q.front();
    q.pop();

    for (int i = 0; i < adj[u].size(); i++) {


    if (visited[adj[u][i]] == false && cursed[adj[u][i]] != 1) {
    visited[adj[u][i]] = true;
    dis[adj[u][i]] = dis[u] + 1;
    q.push(adj[u][i]);

    // We stop BFS when we find


    // destination.
    if (adj[u][i] == tar)
    cout << dis[tar] << endl;

    }
    }

    if( dis[tar] == 0){


    cout << -1 << endl;
    }

    You might also like