BFS Algorithm | Breadth First Search in Graph | BFS Traversal | BFS Graph | DSA-One Course #75

Hey guys, In this video, We're going to learn how the Breadth-First Search Algorithm works and is Implemented.
Practice: www.geeksforge...
💸 Use coupon code ANUJBHAIYA on GeeksforGeeks to avail discounts on courses!
🥳 Join our Telegram Community:
Telegram channel: telegram.me/re...
Telegram group: telegram.me/ds...
🚀 Follow me on:
Instagram: / anuj.kumar.sharma
Linkedin: / sharma-kumar-anuj
Twitter: / realanujbhaiya
📚 Complete DSA Playlist: • DSA-One Course - The C...
Complete Android Development Playlist: • Android Development Tu...
Hashtags:
#anujbhaiya #dsaone
Tags:
bfs
bfs algorithm
breadth first search
bfs traversal
bfs graph
bfs and dfs
bfs dfs
breadth first search algorithm
bfs dfs in data structure
bfs in graph
bfs algoritması
bfs and dfs algorithm
dfs and bfs
dfs and bfs algorithm
graph bfs
bfs of graph
graph traversal in data structure
bfs in data structure
dfs bfs
graph data structure
graph traversal
dsa
bfs in java
anuj bhaiya java
breadth first traversal
bfs java
breadth first search algoritması
breath first search
dfs
bfs code
graph dsa
breadth first search in data structure
graph
graphs dsa
bfs algo
bfs algoritması in hindi
java anuj bhaiya
bfs in c
breadth-first search
dfs algoritması
graph in java
bfs implementation
breadth first search graph
bfs and dfs in graph
bfs in python
breadth first search java
anuj bhaiya dsa
anuj kumar sharma
dfs algorithm
dfs traversal
bfs c++
bfs in daa
bfs in graphs
breadth first search c++
depth first search algorithm
dsa one
graph in data structure
graphs
graphs in c++
bfs and dfs graph
bfs and dfs in data structure
bfs daa
bfs dsa
bfs traversal graph
bfs traversal of graph
breadth first search in artificial intelligence
data structures and algorithms
depth first search
dfs in graph
dsa by anuj bhaiya
graph in dsa
graphs in java
graphs java
anuj
anuj bhai
anuj dsa
bfs algoritm
bfs and dfs in data structures
bfs and dfs traversal
bfs in c++
bfs in ds
bfs in dsa
bfs of a graph
bfs python
bfs search
bfs traversal in graph
bfs tree
bfs vs dfs
breadth
breadth first search python
bredth first search
brute force
code with harry
codehelp
data structures
depth first search and breadth first search
depth-first search
dfs graph
dfs java
dijkstra's algorithm java
dsa anuj bhaiya
dsa course
dsa graph
dsa playlist
dsp anuj bhaiya
graph algorithms
graph bfs dfs
graph data structure java
graph dfs bfs
graph playlist
graph traversal bfs and dfs
graph traversals
hash table
internal working of hashmap in java
java brains
java collections
java dsa

[@MithleshKumar-xq3qo]

First of all I am so sorry if I am wrong, but I have confusions, if your community accepts this comment . Then I would like to point out that there are some mistakes in this video. First your graph 123456 in this video that is not matching with first loop. First loop is initialised with 0 and graph is starts from 1 means adjancey List not confirm. Second in second loop get(u) where is "u" sir I think src will be there.

[@MithleshKumar-xq3qo]

Sorry not "src" there will be "cur"

[@manglaram2589]

@@MithleshKumar-xq3qo right

[@RaviPatel-oe2yj]

What is u??.. Function return value bhoolen and storing ans in int!!??

[@inspirationinyou2811]

Same doubt merko bhi hai bhai

[@rahulsinghshekhawat2487]

The Best playlist for DSA on KZbin. Thank you very much.

[@himanshujakhmola5960]

Anuj Bhaiya- kya always graph 1 se start hoga like 1,2,3,4,5,6 ya random or agar random no honge toh upr jo apne btaya dist[neibor] = dist[cur] + 1; toh agar cur is 15 hai or next 43 hai toh + 1 ka kya logic hoga means use kya hoga?? Anser krna Anuj Bhiya wrna Confusion rh jayega

[@ayushdwivedi8309]

Thank You So Much Bhayia for this awesome DSA playlist.. can you please complete it little quickly... totally dependent on this...

[@Shruti-dj8zs]

what is u in adj.get(u).get(i) ?

[@aakashraj4142]

Tell me too if u know

[@RaviPrajapati-uy1wm]

@@aakashraj4142 in place of 'u' you can replace with 'cur'

[@sekharsamanta6266]

One question Anuj Bhaiya-- What is this 'u' in the code, not defined before

[@RaviPrajapati-uy1wm]

in place of 'u' you can replace with 'cur'

[@tech_wizard9315]

Please make a 60day roadmap for DSA beginner who is working professional, a 60day roadmap to crack Microsoft linkedin level companies

[@tejaskatkade6785]

graph ke component more than 1 honge to dist[] and pred[] array harbar set honge na to code fail karega shayad??

[@manglaram2589]

bhaiya yha apne method bfs mnaya h and call dfs krre ho confusing hora h ye and wo boolean type h and ap int m return kra re ho

[@sureshpathak2008]

bfs code: public static boolean bfs(ArrayList adj, int src, int dest, int v, int pred[], int dist[]) { LinkedList queue = new LinkedList(); boolean visited[] = new boolean[v + 1]; for (int i = 0; i < v; i++) { visited[i] = false; dist[i] = Integer.MAX_VALUE; pred[i] = -1; } visited[src] = true; dist[src] = 0; queue.add(src); while (!queue.isEmpty()) { int cur = queue.remove(); for (int i = 0; i < adj.get(cur).size(); i++) { int neighbour = adj.get(cur).get(i); if (visited[neighbour] == false) { visited[neighbour] = true; dist[neighbour] = dist[cur] + 1; pred[neighbour] = cur; queue.add(neighbour); if (neighbour == dest) { System.out.println("Distance between source & destination: " + dist[dest]); return true; } } } } return false; }

[@dooduboodu8416]

thnx bro this cleared my doubt :- from did tht "u" variable come from

[@ruchikabhandari2768]

For loop should have i

[@Riteshkumar-ih7fj]

@@ruchikabhandari2768 error... index out of bounds exception

[@RajSingh-bb5uj]

really helpful thanks a lot bhaiya

[@raishasingh8130]

thanks for this video.. can you please make one on flipkart runway competition? It is exclusively for females and will give internship opportunities to the winners.. I am in my 2nd year and really want to try my best for this competition.. plz guide

[@yashi5698]

Bhaiya when will video on data analytics will come as I am from computer science background I have tried my best from last 1.5 years and still not get coding 🥲 I think I have not interest in it kindly make a video on what is carrier option other than coding in CS and roadmap to get it

[@rownabdasgupta6006]

code is wrong and we need bfs traversal not only dist[]

[@Swabhimanc]

But sir. What is 'u'... Shouldn't it be adj.get(curr).get(i)

[@aishwaryshukla8880]

yes its 'cur'. Bhaiya replied in one of the comments

[@Swabhimanc]

Thanks Bhai.

[@gamegem574]

Out of bound exception aaraha he bhaiya

[@gitanjalikumari9262]

please also show code in c++ if possible..it will be more helpful..but awesome explanation..thanks!

[@meetsoni1938]

If we get the destination before going through each node in one component of graph then how can we find the no. Of components??

[@rakshitraushan1650]

u kidhar se aaya bhaiya

[@angelaroy946]

can someone please clarify what is u here @Anuj Bhaiya

[@Jv_Singh37]

i think ' u ' should be replace with ' cur '

[@akshaygade7882]

pls run the code at end

[@neelsheth7706]

Nahi hoga run.. Wrong code he.. Errors he

[@ahariomangle4084]

1st

[@toyabali5262]

Great explain... thanks bhaiya..

[@prachikumari5574]

Sharma wo v Anuj "the best" . Thankyou bhaiya easily smjhane k liye.☺️

[@jayaswalrajp]

Very nice video.. maza aa gya bhaiya

[@pranalivekhande4450]

Bahut fast padha rahe ho...confusion ho raha hai😢

[@mandeepkaur749]

Great Explanation !

[@psycho_gaming2422]

you made graph so easy, awesome!!

[@samrat8413]

Well explained.

[@chandnibhatia1211]

why do we keep predecessor array ..

[@ManikChakraborty]

Really helpful

[@643kanavguleria9]

if we remove "vis[neighbour] == false" if statement from the while loop and add a condition that "if the new distance in lesser than previous distance only than we will add something in queue" by this can we find the shortest distance to reach from point a to point b

[@souravu5121]

Thank you so much

[@643kanavguleria9]

as we are using predecesor array to track back the whole path , can we find multiple paths to reach from point "a" to "b" point b if they are present

[@ml9421]

bhayia it is so well explained please make a video on BFS , dfs , dls, uniform cost search, and greedy best-first search in python

[@girlysh09]

whenever the pop out of like is appear i pause the video first and go to like, thanks for the pop out ;p

[@gamegem574]

In for loop what is 'u'

[@AnujBhaiya]

It's cur. Misspelt

[@gamegem574]

@@AnujBhaiya i have written but showing out of bound

[@ruchikabhandari2768]

@@gamegem574 this is because I think the for loop need to be from 1 to v+1

[@gamegem574]

Yup i have solved that thing

[@dipakpatil-hz6mg]

@Anuj For 2nd question finding the total connected component. Your using same fun BFS and passing last parameter as Vis wht is that? Also as per declaration of bfs fun it has 6 arguments and your passing 7 argument while finding the total component in the graph

[@anket_singh9003]

Samjh me nhi aaya kuch bhi

[@deepakdas6423]

What is "u" variable?

[@neelsheth7706]

same question

[@varunkhulbey1351]

It was a typo. It's 'cur' actually instead of 'u'.

[@ashishsingh3850]

Badhiya hai bhaiya

[@realityvirtuality1231]

agar hme graph 1 2 and 1000 ka banana pde tb visited array size will be 1000 lagegi kya

[@the_nishantsourav9331]

so many mistajes found in ur code

[@sarangavadiya7087]

really helpful thank for your awesome work

[@sekharsamanta6561]

Spectacular!

[@643kanavguleria9]

what is (u) in adj.get(u).size() at line 24 ------> 9:09

[@manglaram2589]

it is cur instead of u

[@ayanchakraborty1931]

bhaiya int neighbour = adj.get(u).get(i) isme u kya hai? i think wo cur hoga

[@time-to-rise3900]

while fetching element from adjency list you kept adj.get(u).get(i), it should be adj.get(cur).get(i)