FilesExpand file tree

 main

/

dfs.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

23 lines (19 loc) · 564 Bytes

 main

/

dfs.py

Copy path

Top

File metadata and controls

• Code
• Blame

23 lines (19 loc) · 564 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

#DFS

n = int(input("Enter the number of nodes : "))

graph = {};

for i in range(n):

temp = list(map(str, input().split()))

if len(temp) > 1:

graph[temp[0]] = temp[1:]

else:

graph[temp[0]] = []

visited = set();

def dfs(visited, graph, node):

if node not in visited:

print(node, end = ' ')

visited.add(node)

for neighbour in graph[node]:

dfs(visited, graph, neighbour);

source = str(input("Enter the source node : "))

print("Following DFS is : ")

dfs(visited, graph, source)