breadth_first_search.cpp File Reference

Breadth First Search Algorithm (Breadth First Search) More...

#include <algorithm>
#include <cassert>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>

Include dependency graph for breadth_first_search.cpp:

Go to the source code of this file.

Classes
class	graph::Graph< T >

Namespaces
namespace	graph
	Graph Algorithms.

Functions
static void	tests ()
int	main ()

Detailed Description

Breadth First Search Algorithm (Breadth First Search)

Author

Ayaan Khan

Aman Kumar Pandey

Breadth First Search also quoted as BFS is a Graph Traversal Algorithm. Time Complexity O(|V| + |E|) where V are the number of vertices and E are the number of edges in the graph.

Applications of Breadth First Search are

1. Finding shortest path between two vertices say u and v, with path length measured by number of edges (an advantage over depth first search algorithm)
2. Ford-Fulkerson Method for computing the maximum flow in a flow network.
3. Testing bipartiteness of a graph.
4. Cheney's Algorithm, Copying garbage collection.

And there are many more...

working

In the implementation below we first created a graph using the adjacency list representation of graph. Breadth First Search Works as follows it requires a vertex as a start vertex, Start vertex is that vertex from where you want to start traversing the graph. We maintain a bool array or a vector to keep track of the vertices which we have visited so that we do not traverse the visited vertices again and again and eventually fall into an infinite loop. Along with this boolen array we use a Queue.

1. First we mark the start vertex as visited.
2. Push this visited vertex in the Queue.
3. while the queue is not empty we repeat the following steps
   1. Take out an element from the front of queue
   2. Explore the adjacency list of this vertex if element in the adjacency list is not visited then we push that element into the queue and mark this as visited

Definition in file breadth_first_search.cpp.

Function Documentation

main()

int main

(

void

)

Main function

Definition at line 186 of file breadth_first_search.cpp.

           {
    tests();
    size_t edges = 0;
    std::cout << "Enter the number of edges: ";
    std::cin >> edges;
 
    graph::Graph<int> g;
 
    std::cout << "Enter space-separated pairs of vertices that form edges: "
              << std::endl;
    while (edges--) {
        int u = 0, v = 0;
        std::cin >> u >> v;
        g.add_edge(u, v);
    }
 
    g.breadth_first_search(0);
    return 0;
}

tests()

static void tests ( )

static

Test function

Test 1 Begin

Test 2 Begin

Test 3 Begins

Definition at line 139 of file breadth_first_search.cpp.

                    {
    graph::Graph<int> g;
    std::map<int, bool> correct_result;
    g.add_edge(0, 1);
    g.add_edge(1, 2);
    g.add_edge(2, 3);
    correct_result[0] = true;
    correct_result[1] = true;
    correct_result[2] = true;
    correct_result[3] = true;
 
    std::map<int, bool> returned_result = g.breadth_first_search(2);
 
    assert(returned_result == correct_result);
    std::cout << "Test 1 Passed..." << std::endl;
 
    returned_result = g.breadth_first_search(0);
 
    assert(returned_result == correct_result);
    std::cout << "Test 2 Passed..." << std::endl;
 
    graph::Graph<std::string> g2;
 
    g2.add_edge("Gorakhpur", "Lucknow", false);
    g2.add_edge("Gorakhpur", "Kanpur", false);
    g2.add_edge("Lucknow", "Agra", false);
    g2.add_edge("Kanpur", "Agra", false);
    g2.add_edge("Lucknow", "Prayagraj", false);
    g2.add_edge("Agra", "Noida", false);
 
    std::map<std::string, bool> correct_res;
    std::map<std::string, bool> returned_res =
        g2.breadth_first_search("Kanpur");
    correct_res["Gorakhpur"] = false;
    correct_res["Lucknow"] = false;
    correct_res["Kanpur"] = true;
    correct_res["Agra"] = true;
    correct_res["Prayagraj"] = false;
    correct_res["Noida"] = true;
    assert(correct_res == returned_res);
    std::cout << "Test 3 Passed..." << std::endl;
}