Python Program To Implement DFS Using Recursion | Data Structure

In this Python Programming video tutorial you will learn how to write function for DFS implementation in detail.

Data structure is a way of storing and organising the data so that it can be accessed effectively.
Graph is a non linear data structure consisting of nodes and edges.

Add_node

Add_edge

Delete_node

Delete_edge

#DataStructures #PythonPrograms #Graph

For more free tutorials on computer programming

[seekingtruth]

I am so glad to find your channel. Thank you so much for uploading this video. Your explanation is excellent. Please keep posting more algorithm videos.

[Rishabh_Cric]

Thank you mam😊I am totally dependent on your videos on my upcoming placements

[alagappank]

Thank you mam💪, also complete the series..

[ml]

It is so well explained please make a video on BFS, dls, uniform cost search, and greedy best-first search

[adi_ch.]

Make a video seperatey on weighted graph

[akashvardhan]

Simply the best. Please make video for bfs too

[descendantsoftheheroes_]

Thanks mam ...Compete algorithm basic to advance with implementation in Python

[alagappank]

Do video for difference between library, package, module, framework...

[tripurarikumarjha]

Please try this once Mam, in this argument of the function will be node from which we want to start,

def traversal(a): #we will have to mention the node where we want to start
global node_count
if a not in nodes:
print("Node not present")
return
l1=graph[a]
if a not in a2:
a2.append(a)

if len(a2)==node_count: #base condition
return
else:
for i in l1:
if i not in a2:
stack.put(i)
a=stack.get()#backtracking
traversal(a)
return a2

[gauravwithpython]

plz make the playlist on dynamic programming 🙏

[rathnam]

Mam, can't we traverse all the elements in the disconnected graph using this method

[ikik]

Iam getting this error -->
for i in graph[node]:
TypeError: list indices must be integers or slices, not str

[moviemashup.]

TypeError: unhashable type: 'list' i am getting this error