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

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

Рет қаралды 329,079

Education 4u

4 жыл бұрын

Example on breadth first search algorithm in artificial intelligence

Пікірлер: 55

@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 2 жыл бұрын

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

@nickbaib1839 4 жыл бұрын

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

@user-ud9pf5hf6s 5 ай бұрын

Excellent teaching Mam👏👏

@CDJunainah Жыл бұрын

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

@cherryrodriguez6620 2 жыл бұрын

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

@shashank6753 3 жыл бұрын

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

@thushararavindu7 7 ай бұрын

Thank you very much ma'am 😍

@kranthisiriki539 2 жыл бұрын

Why should we take weights and what are weights

@chandratheexplorer 8 ай бұрын

WOW SOLUTION EXPLAINED

@hadjer168 2 жыл бұрын

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 : kzfaq.info/get/bejne/hNiBetuXq7O9qqc.html

@nahomaraya2377 2 жыл бұрын

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

@hadjer168 2 жыл бұрын

@@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 ==> kzfaq.info/get/bejne/hNiBetuXq7O9qqc.html

@abhijitmanna4524 Жыл бұрын

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

@asitgaming331 2 жыл бұрын

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

@farhathjahan2951 Жыл бұрын

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

@mahalakshmia3287 3 ай бұрын

That's question

@arpitsharma981 Жыл бұрын

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

@kehi19 7 ай бұрын

Can u explain pls?

@saurav2409 6 ай бұрын

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

@krayeldix5827 3 ай бұрын

@@saurav2409ufc3

@amonishkumar9761 4 жыл бұрын

Thank you mam

@xpertstrategist2216 2 жыл бұрын

Very well explained thank you very much!

@manfredmbedzi8137 3 жыл бұрын

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

@EveryDaymast 3 жыл бұрын

Because of breath first search ----->

@suneeth_kumar 2 жыл бұрын

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

@Good-points 3 ай бұрын

thanks alot

@Mr.Bichitra 3 жыл бұрын

why the weights of the edges are not considered?

@AHMED-ly2ml 3 жыл бұрын

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

@naelssam8147 4 жыл бұрын

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

@gokulboopathi901 3 жыл бұрын

A tree is a graph but all graphs are not trees

@srinjoyghosh7273 3 жыл бұрын

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

@duaqureshi8637 Жыл бұрын

why u didnt take SADG or SBDG ?

@fatemehhooshangi871 2 ай бұрын

the solution is the low depth path

@user-ud9pf5hf6s 5 ай бұрын

Excellent teaching Mam 👏👏

@Regular_guy12 2 жыл бұрын

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

@NigatuAsfewu 2 ай бұрын

Exercise: Apply Uninformed Search Strategies to identify optimal path

@NigatuAsfewu 2 ай бұрын

exercise this

@sayanghosh6544 Жыл бұрын

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

@vrishbhansingh2597 Жыл бұрын

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

@saishanmukh7831 3 жыл бұрын

The path should be SABG ryt

@tharaka.insfra2026 3 жыл бұрын

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

@rishazara415 2 жыл бұрын

Ur answer is wrong

@paulmbangweta6698 Жыл бұрын

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

@Abhishekkumar-wk5nb 2 жыл бұрын

Wrong solution

@paulmbangweta6698 Жыл бұрын

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

@arunlohan302 7 ай бұрын

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

@innercircletradertevision 3 ай бұрын

@riyadh5449 Жыл бұрын

Damn to Hindi accent

@MrRop-yp3wt 3 жыл бұрын

horrible explanation

@sadathhussain1619 3 жыл бұрын

Mean good or bad?

@skh7056 2 жыл бұрын

Horrible means bad nehhhh?????

@skh7056 2 жыл бұрын

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

@ujjwaljain2421 4 ай бұрын

Lgta h fail krayegi

@Divya-yv1gs 2 жыл бұрын

Thank you mam