Corrected Indentation

Graph/BFS.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+	#ifndef ONLINE_JUDGE
+	freopen("in.txt", "r", stdin);
+	#endif
+	queue<int> q;
+	int i, n, e, x, y, cv, f;
+	cv = 1;
+	cout << "Enter no of nodes" << endl;
+	cin >> n;
+
+	cout << "Enter no of edges" << endl;
+	cin >> e;
+
+	int visit[n + 1];
+
+	for (i = 1; i <= n; ++i) {
+		visit[i] = 0;
+	}
+
+	vector<int> v[n + 1];
+	//created an array of vectors to store the adjacency list n is equal to no of nodes
+	//each row of this adjacency list shows the conencted edges of that particular vertex 
+
+	//creating the adjacency list
+	for (i = 0; i < e; i++) {
+		cin >> x >> y;
+		v[x].push_back(y);
+		v[y].push_back(x); 
+	}
+
+	q.push(cv);
+	visit[cv] = 1;
+
+	cout << "BFS of the given graph \n";
+	while(!q.empty()) {
+		f = q.front();
+		q.pop();
+		cout << f << " ";
+
+		//until all connected vertices are in the queue
+		for(i = 0; i < v[f].size(); i++)  {
+			//if not previously visited
+			if (visit[v[f][i]] == 0) {
+				//push in queue and and the vertex to visited list
+				q.push(v[f][i]);
+				visit[v[f][i]] = 1;
+			}
+		}
+	}
+
+	return 0;
+}

Graph/DFS.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <stack>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+	#ifndef ONLINE_JUDGE
+	freopen("in.txt", "r", stdin);
+	#endif
+	stack<int> s;
+	int i, n, e, x, y, cv, f;
+	cv = 1;
+	cout << "Enter no of nodes" << endl;
+	cin >> n;
+
+	cout << "Enter no of edges" << endl;
+	cin >> e;
+
+	vector<int> visit;
+
+	vector<int> v[n + 1];
+	//created an array of vectors to store the adjacency list n is equal to no of nodes
+	//each row of this adjacency list shows the conencted edges of that particular vertex 
+
+	//creating the adjacency list
+	for (i = 0; i < e; i++) {
+		cin >> x >> y;
+		v[x].push_back(y);
+		v[y].push_back(x); 
+	}
+
+	s.push(cv);
+	cout << "BFS of the given graph \n";
+	while(s.size() != n) {
+		f = (int)s.pop();
+		x = v[f][0];
+	}
+
+	return 0;
+}

Graph/in.txt

@@ -0,0 +1,8 @@
+8 7
+3 5
+1 4
+1 3
+2 5
+3 6
+4 7
+4 8

Searching/BSearch.cpp

@@ -8,7 +8,7 @@ int Bsearch (int a[], int k, int p, int r)
 		int m;
 		m = (p + r)/2;
 		if (a[m] == k) {
-			cout<<"ELement Found at "<<m<<"th index"<<endl;
+			cout << "ELement Found at " << m << "th index" << endl;
 			return 1;
 		}
 		else if (k < a[m]) {
@@ -24,7 +24,7 @@ int Bsearch (int a[], int k, int p, int r)
 void status (int s)
 {
 	if (s == 0) {
-		cout<<"Element not found"<<endl;
+		cout << "Element not found" << endl;
 	}
 }
 

Searching/LSearch.cpp

@@ -18,10 +18,10 @@ int main(int argc, char const *argv[])
 	}
 
 	if(j == -1) {
-		cout<<"Element not found"<<endl;
+		cout << "Element not found" << endl;
 	}
 	else {
-		cout<<"Element found at "<<j<<"th index of array"<<endl;
+		cout << "Element found at " << j << "th index of array" << endl;
 	}
 
 	return 0;

Sorting/Heap.cpp

@@ -57,7 +57,7 @@ int main()
 
 	// printing sorted array
 	for (i = 0; i < SIZE; i++) {
-		cout<<a[i]<<"\t";
+		cout << a[i] << "\t";
 	}
 
 	return 0;

Sorting/Insertion.cpp

@@ -24,7 +24,7 @@ int main(int argc, char const *argv[])
 
 	//printing sorted array
 	for (i = 0; i < SIZE; i++) {
-		cout<<a[i]<<"\t";
+		cout << a[i] << "\t";
 	}
 
 	return 0;

Sorting/Merge.cpp

@@ -59,7 +59,7 @@ int main()
 
 	// printing sorted array
 	for (i = 0; i < SIZE; i++) {
-		cout<<a[i]<<"\t";
+		cout << a[i] << "\t";
 	}
 	return 0;
 }

Sorting/Selection.cpp

@@ -21,7 +21,7 @@ int main(int argc, char const *argv[])
 
 	//printing sorted array
 	for (i = 0; i < SIZE; i++) {
-		cout<<a[i]<<"\t";
+		cout << a[i] << "\t";
 	}
 
 	return 0;