From dde69f4cf2b023771b0df636bd11a32963366e9d Mon Sep 17 00:00:00 2001
From: Siddhartha-chaki <siddharthachaki02@gmail.com>
Date: Sat, 26 Oct 2019 20:53:32 +0530
Subject: [PATCH] Breadth first search algorithm in C++

---
 data_structures/Queue/C++/bfs.cpp | 36 +++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 data_structures/Queue/C++/bfs.cpp

diff --git a/data_structures/Queue/C++/bfs.cpp b/data_structures/Queue/C++/bfs.cpp
new file mode 100644
index 0000000..ddcac8d
--- /dev/null
+++ b/data_structures/Queue/C++/bfs.cpp
@@ -0,0 +1,36 @@
+#include<iostream.h>
+#include<conio.h>
+#include<stdlib.h>
+int cost[10][10],i,j,k,n,qu[10],front,rare,v,visit[10],visited[10];
+void main()
+{ clrscr();
+int m;
+cout <<"Enter no of vertices";
+cin >> n;
+cout <<"Enter no of edges";
+cin >> m;
+cout <<"\nEDGES \n";
+for(k=1;k<=m;k++)
+{ cin >>i>>j;
+cost[i][j]=1;
+}
+cout <<"Enter initial vertex";
+cin >>v;
+cout <<"Visitied vertices\n";
+cout <<v<<" ";
+visited[v]=1;
+k=1;
+while(k<n)
+{
+for(j=1;j<=n;j++)
+if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)
+{
+visit[j]=1;
+qu[rare++]=j;
+}
+v=qu[front++];
+cout<<v<<" ";
+k++;
+visit[v]=0; visited[v]=1;
+getch();
+}}
\ No newline at end of file