Question

Textbook is : Analysis of algorithms

l el as the visit operation. You should trace it using the graphs in this section to make sure you get the same answer. 4. Write a detailed algorithm for breadth-first traversal using an adjacency matrix that just prints the node label as the visit operation. You should trace it using the graphs in this section to make sure you get the same answer. 5. Write a detailed oli

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

void BFS(int start)

{

    // Visited vector to so that

    // a vertex is not visited more than once

    // Initializing the vector to false as no

    // vertex is visited at the beginning

    vector<bool> visited(v, false);

    vector<int> q;

    q.push_back(start);

  

    // Set source as visited

    visited[start] = true;

  

    int vis;

    while (!q.empty()) {

        vis = q[0];

  

        // Print the current node

        cout << vis << " ";

        q.erase(q.begin());

  

        // For every adjacent vertex to the current vertex

        for (int i = 0; i < v; i++) {

            if (adj[vis][i] == 1 && (!visited[i])) {

  

                // Push the adjacent node to the queue

                q.push_back(i);

  

                // Set

                visited[i] = true;

            }

        }

    }

}

  

Kindly revert for any queries

Thanks.