Lecture 31 - Depth First Search (DFS) traversal in Undirected Graph (മലയാളത്തിൽ) - Data Structures

Depth First Search (DFS) algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration.
DFS traversal of a graph, produces a spanning tree as final result. Spanning Tree is a graph without any loops. We use Stack data structure with maximum size of total number of vertices in the graph to implement DFS traversal of a graph.

[@lneivasco9588]

Thank you sir.... sir inte സൗണ്ട് ramesh pisharody yude പോലെ ഉണ്ട് 😁❤

[@jbr358]

Sir class nala pole manasilavunund ith illayirunel njn pottumayirunu thankyou so much sir❤❤

[@user-nt9oc7zu9u]

Thankyou helpful 🙏

[@_.vishnuprasad__]

Nice class sir👍🥰

[@sheebae.k.2114]

good teaching

[@seethu.k7996]

Thank you sir, owsome class

[@abhimanyua.s38]

wow super explanation sir keep going

[@tutefox4921]

thank you so much, please subscribe channel and share to friends

[@jainbennypayyappilly5171]

Thankuu sir

[@kuripptva6935]

Useful💗thanku

[@jainbennypayyappilly5171]

Thank you sooo much for this classs

[@tutefox4921]

than you for your support, please share to friends and subscribe the channel

[@sugeshmasugee6809]

Ithnte algorithm ayako sir

[@bcaclass123]

❤