Depth First Search | DFS | Examples | Graph traversal | Design & Algorithms | Lec-32 | Bhanu Priya

Graph traversal : Depth First search algo with example explained

[@lubanjwafrancis4885]

I have enjoyed the Lecture thx madam for the good explanations

[@Adam-gp3ij]

How you poped A since there is E 8:35

[@sanc7897]

She done a gamble right over there 😂

[@anshidanesrinka3082]

Mam , stack is lifo mode right? Then how can you pop A from the stack 8:52

[@kusamansari4289]

A jo humara h visit ho chuka h is liye mam ji A ko pop kr diye ab hum A ke adjacent ko dekhenge jo ki h B..... B se ab humara koi node nhi ja rha h to B ko bhi hum pop kr denge

[@likithalikitha7817]

It was simply super

[@harshitdixit7190]

stack m deletion top s hota hai... so y did you popped the element A

[@user-rq5rk5nh1n]

very good explanation mam thank you

[@techpoints9012]

Stack storage technique is Lifo(last in first out )

[@rashidpervaiz1002]

Where you search depth wise

[@arunakatta2288]

Mam warshall's algorithm explain chesara explain cheyara mam

[@neetuprajapati2116]

Mam can we know how A is popped out

[@Maverick_..]

I got the answer A B E C D F I H G......is it right ??

[@rumanzahid6671]

Thankkksssssssssssssssssss

[@ittidashing]

BFS teach good, DFS not teach good :(

[@saicharan4081]

Wr is pseudo code like bfs

[@ranjitmahato7547]

It is dfs why r u taking stack

[@ittidashing]

Lobe your voice wot iz

[@ayeshaimdad9306]

yes mam ur voice gr8

[@ittidashing]

Who u :3

[@sayantandas7054]

This is completely wrong method... At first learn about it... Don't mind but pls learn and teach

[@ahsanali3275]

Fazool method