Breadth first search algorithm Example | BFS | uninformed | AI | Lec-13 | Bhanu Priya

[@getachewmelkam]

the path is "s a b c d g " in BFS you did by DFS algorithm. why cost is used in BFS it is brute/blind or uninformed algorithm? any ways thankyou.

[@radhakrishna8003]

Thank You Ma'am.God Bless You 🙏🙏🙏

[@hadjer168]

We explore a node only once through an edge not many times, so you're wrong in step 3 and step 4 (there is no step 4 by the way, the algorithm stops at step 3). In step 3, G can be only discovered by node B and then the solution will be S-B-G and the tree will be like :
at level 0 : S
at level 1 : A B C (related to S)
at level 2 : D related to A , G related to B
Source : ua-cam.com/video/NrQGxfFMYzs/v-deo.html

[@nahomaraya2377]

I cannot speak French so I'll take your word on it for this one

[@hadjer168]

​@@nahomaraya2377 the presentation in that video is done by animation so you can only watch it and relate with my words. The animation of the algo starts from 2:00 to 6:53 ==> ua-cam.com/video/NrQGxfFMYzs/v-deo.html

[@abhijitmanna4524]

yes she is wrong, though she taught correct in data structure playlist, but this is wrong

[@nickbaib1839]

Thank you so much!
You upload this video in the best time!

[@AbinayaV-q1r]

Excellent teaching Mam👏👏

[@SuchahaiHero]

Bhai Fail hogya tha ya bach gya tha

[@aravindvalsarajan3284]

Can we use weights here?, I'm not sure about that.

[@arpitsharma981]

The solution you gave was for the dfs here but it was asking for bfs so there is a mistake there

[@kehi19]

Can u explain pls?

[@saurav2409]

No no ,she did it correctly ,that is only the bfs way

[@krayeldix5827]

​@@saurav2409ufc3

[@NigatuAsfewu]

Exercise: Apply Uninformed Search Strategies to identify optimal path

[@NigatuAsfewu]

exercise this

[@shashank6753]

S,c,b,a,g path should be taken breth wise if we kar moving why we move s,b,g depth

[@cherryrodriguez6620]

Thank you for this lecture! you made it easier for me to understand this topic!

[@thushararavindu7]

Thank you very much ma'am 😍

[@chandratheexplorer]

WOW SOLUTION EXPLAINED

[@PLstoriesofficial]

While finding a path from a s to g there any need to consider minamal cost

[@education4uofficial]

Website:education4u.in

[@kranthisiriki539]

Why should we take weights and what are weights

[@CDJunainah]

Hai,, may I know how to arrange the vertex in tree.. what is conditions to arrange them in tree

[@asitgaming331]

how to elaborate this as answer for 4 marks question in exam.

[@naelssam8147]

thank u for lecture . I have question . what is difference between tree and graph ?

[@gokulboopathi901]

A tree is a graph but all graphs are not trees

[@srinjoyghosh7273]

Graphs can be straight lines or a single curve also, but a Tree must have branches.

[@farhathjahan2951]

Can you please explain how you gave the "weights" in graph

[@mahalakshmia3287]

That's question

[@xpertstrategist2216]

Very well explained thank you very much!

[@manfredmbedzi8137]

Thank you. Just one question, since we have a node transverse D - G why don't we have G - D

[@EveryDaymast]

Because of breath first search ----->

[@suneeth_kumar]

because our goal state is G so there is no need to visit its neighbouring nodes. that's y there is no G-D

[@Mr.Bichitra]

why the weights of the edges are not considered?

[@AHMED-ly2ml]

This is uninformed search(brute force) it does not take into consideration costs/heuristics

[@Good-points]

thanks alot

[@kitchenaryy]

why u didnt take SADG or SBDG ?

[@fatemehhooshangi871]

the solution is the low depth path

[@arunlohan302]

This is DFS or BFS 😂😂😂😅😅😅😅😅😅 i think you confuse

[@amonishkumar9761]

Thank you mam

[@Somsom11]

THX

[@Regular_guy12]

I m confused at last, that's not how BFS work!! I mean how came she didn't go breadth wise???? According to rule

[@sayanghosh6544]

Sorry to say, but it's not BFS method what you're talking about.

[@saishanmukh7831]

The path should be SABG ryt

[@tharaka.karu96]

since this is bfs path should be S->A->B->C->D-> G. she didn't concern about the traverse through the levels.

[@vrishbhansingh2597]

Atleast tell the reason why we choose those 2 paths no reasons about why we choose that

[@rishazara415]

Ur answer is wrong

[@paulmbangweta6698]

it's s,a,b,c,d,g right?

[@gargimohanty955]

The procedure is wrong. This path is for DFS

[@MrRop-yp3wt]

horrible explanation

[@sadathhussain1619]

Mean good or bad?

[@skh7056]

Horrible means bad nehhhh?????

[@skh7056]

And even she get answers deapth wise, not breadth wise😕

[@innercircletradertevision]

Ok

[@amals9122]

chechi enike manasilayillaaaa

[@riyadh5449]

Damn to Hindi accent

[@Abhishekkumar-wk5nb]

Wrong solution

[@paulmbangweta6698]

it's s,a,b,c,d,g right?

[@ujjwaljain2421]

Lgta h fail krayegi

[@ahmedabood650]

That's is so wrong
This is not BFS
this is DFS

[@AbinayaV-q1r]

Excellent teaching Mam 👏👏

[@Divya-yv1gs]

Thank you mam