Skip to main content

Create a program to represent a graph using an adjacency list and perform Breadth-First Search (BFS) to systematically visit all vertices.

CODE:


 #include <iostream>

#include <list>

#include <queue>


using namespace std;


// Class representing a graph

class Graph {

    int V; // Number of vertices


    // Pointer to an array containing adjacency lists

    list<int> *adj;


public:

    Graph(int V); // Constructor


    // Function to add an edge to the graph

    void addEdge(int v, int w);


    // BFS traversal starting from a given vertex

    void BFS(int s);

};


Graph::Graph(int V) {

    this->V = V;

    adj = new list<int>[V];

}


void Graph::addEdge(int v, int w) {

    adj[v].push_back(w); // Add w to v's list.

}


void Graph::BFS(int s) {

    // Mark all the vertices as not visited

    bool *visited = new bool[V];

    for (int i = 0; i < V; i++)

        visited[i] = false;


    // Create a queue for BFS

    queue<int> queue;


    // Mark the current node as visited and enqueue it

    visited[s] = true;

    queue.push(s);


    // 'i' will be used to get all adjacent vertices of a vertex

    list<int>::iterator i;


    while (!queue.empty()) {

        // Dequeue a vertex from queue and print it

        s = queue.front();

        cout << s << " ";

        queue.pop();


        // Get all adjacent vertices of the dequeued vertex s.

        // If an adjacent vertex has not been visited, then mark it

        // visited and enqueue it

        for (i = adj[s].begin(); i != adj[s].end(); ++i) {

            if (!visited[*i]) {

                visited[*i] = true;

                queue.push(*i);

            }

        }

    }

}


int main() {

    // Create a graph given in the example

    Graph g(4);

    g.addEdge(0, 1);

    g.addEdge(0, 2);

    g.addEdge(1, 2);

    g.addEdge(2, 0);

    g.addEdge(2, 3);

    g.addEdge(3, 3);


    cout << "Breadth First Traversal (starting from vertex 2): ";

    g.BFS(2);


    return 0;

}



Popular posts from this blog

krushnaaa

  import java . awt .* ; import java . awt . event .* ; public class SimpleAWTExample {     public static void main ( String [] args ) {         // Create a Frame         Frame frame = new Frame ( "Simple AWT Example" );         // Create a Button         Button button = new Button ( "Click Me!" );         // Set layout for the Frame         frame . setLayout ( new FlowLayout ());         // Add the Button to the Frame         frame . add ( button );         // Set size of the Frame         frame . setSize ( 300 , 200 ); // Width: 300 pixels, Height: 200 pixels         // Make the Frame visible         frame . setVisible ( true );         // Add a WindowListener to handle closing event     ...
Read more

Write a program to create a class Student2 along with two method getData (), printData () to get the value through argument and display the data in printData. Create the two objects s1, s2 to declare and access the values from class STtest.

 CODE: import java.util.Scanner; class Student2 {     private String name;     private int age;          // Method to set data     public void getData(String name, int age) {         this.name = name;         this.age = age;     }          // Method to print data     public void printData() {         System.out.println("Name: " + name);         System.out.println("Age: " + age);     } } public class STtest {     public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);                  // Creating objects of Student2 class         Student2 s1 = new Student2();         Student2 s2 = new Student2();              ...
Read more

Create an in-order threaded binary search tree and perform the traversals.(Double Thread)

 CODE: #include <iostream> using namespace std; struct Node {     int data;     Node* left;     Node* right;     bool leftThread;     bool rightThread; }; Node* createThreadedBST(int arr[], int n) {     Node* root = nullptr;     for (int i = 0; i < n; ++i) {         Node* newNode = new Node;         newNode->data = arr[i];         newNode->left = newNode->right = nullptr;         newNode->leftThread = newNode->rightThread = true;         if (root == nullptr) {             root = newNode;         } else {             Node* current = root;             Node* parent = nullptr;             while (true) {                ...
Read more