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 : th-cam.com/video/NrQGxfFMYzs/w-d-xo.html
@@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 ==> th-cam.com/video/NrQGxfFMYzs/w-d-xo.html
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.
Thank You Ma'am.God Bless You 🙏🙏🙏
Thank you so much!
You upload this video in the best time!
Excellent teaching Mam👏👏
Hai,, may I know how to arrange the vertex in tree.. what is conditions to arrange them in tree
Thank you for this lecture! you made it easier for me to understand this topic!
WOW SOLUTION EXPLAINED
Thank you very much ma'am 😍
Thank you mam
S,c,b,a,g path should be taken breth wise if we kar moving why we move s,b,g depth
how to elaborate this as answer for 4 marks question in exam.
The solution you gave was for the dfs here but it was asking for bfs so there is a mistake there
Can u explain pls?
No no ,she did it correctly ,that is only the bfs way
@@saurav2409ufc3
Thank you. Just one question, since we have a node transverse D - G why don't we have G - D
Because of breath first search ----->
because our goal state is G so there is no need to visit its neighbouring nodes. that's y there is no G-D
Why should we take weights and what are weights
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 : th-cam.com/video/NrQGxfFMYzs/w-d-xo.html
I cannot speak French so I'll take your word on it for this one
@@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 ==> th-cam.com/video/NrQGxfFMYzs/w-d-xo.html
yes she is wrong, though she taught correct in data structure playlist, but this is wrong
Very well explained thank you very much!
Excellent teaching Mam 👏👏
thanks alot
thank u for lecture . I have question . what is difference between tree and graph ?
A tree is a graph but all graphs are not trees
Graphs can be straight lines or a single curve also, but a Tree must have branches.
Can you please explain how you gave the "weights" in graph
That's question
I m confused at last, that's not how BFS work!! I mean how came she didn't go breadth wise???? According to rule
This is DFS or BFS 😂😂😂😅😅😅😅😅😅 i think you confuse
why the weights of the edges are not considered?
This is uninformed search(brute force) it does not take into consideration costs/heuristics
Sorry to say, but it's not BFS method what you're talking about.
Atleast tell the reason why we choose those 2 paths no reasons about why we choose that
Exercise: Apply Uninformed Search Strategies to identify optimal path
exercise this
why u didnt take SADG or SBDG ?
the solution is the low depth path
The path should be SABG ryt
since this is bfs path should be S->A->B->C->D-> G. she didn't concern about the traverse through the levels.
Wrong solution
it's s,a,b,c,d,g right?
Ur answer is wrong
it's s,a,b,c,d,g right?
Damn to Hindi accent
Ok
horrible explanation
Mean good or bad?
Horrible means bad nehhhh?????
And even she get answers deapth wise, not breadth wise😕
Lgta h fail krayegi
Thank you mam