graphs

whoparthgarg · whoparthgarg · commit 31beff1a8c19 · 2021-08-26T11:48:30.000+05:30
diff --git a/17. Graphs/04c Breadth First Search.cpp b/17. Graphs/04c Breadth First Search.cpp
@@ -1,7 +1,7 @@
 #include<bits/stdc++.h>
 using namespace std;
 
-//find number of islands problem
+//find number of islands problem or find number of connected components
 void bfs(vector<int> adj[], int s, bool visited[])
 {
 	queue<int> q;

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`#include<bits/stdc++.h>`
`2`	`2`	`using namespace std;`
`3`	`3`
`4`		`-//find number of islands problem`
	`4`	`+//find number of islands problem or find number of connected components`
`5`	`5`	`void bfs(vector<int> adj[], int s, bool visited[])`
`6`	`6`	`{`
`7`	`7`	`queue<int> q;`