Bisakah Anda memberi tahu saya apa yang salah dalam kode DFS di bawah ini. Ini memberikan hasil yang benar AFAIK, tapi saya tidak tahu kapan akan gagal.
graph1 = {
'A' : ['B','S'],
'B' : ['A'],
'C' : ['D','E','F','S'],
'D' : ['C'],
'E' : ['C','H'],
'F' : ['C','G'],
'G' : ['F','S'],
'H' : ['E','G'],
'S' : ['A','C','G']
}
visited = []
def dfs(graph,node):
global visited
if node not in visited:
visited.append(node)
for n in graph[node]:
dfs(graph,n)
dfs(graph1,'A')
print(visited)
Keluaran:
['A', 'B', 'S', 'C', 'D', 'E', 'H', 'G', 'F']
Saya pikir Anda memiliki masalah indentasi di sana. Dengan asumsi kode Anda terlihat seperti ini:
graph1 = {
'A' : ['B','S'],
'B' : ['A'],
'C' : ['D','E','F','S'],
'D' : ['C'],
'E' : ['C','H'],
'F' : ['C','G'],
'G' : ['F','S'],
'H' : ['E','G'],
'S' : ['A','C','G']
}
visited = []
def dfs(graph,node):
global visited
if node not in visited:
visited.append(node)
for n in graph[node]:
dfs(graph,n)
dfs(graph1,'A')
print(visited)
Saya akan mengatakan beberapa hal:
plus:
Kode yang diperbarui:
graph1 = {
'A' : ['B','S'],
'B' : ['A'],
'C' : ['D','E','F','S'],
'D' : ['C'],
'E' : ['C','H'],
'F' : ['C','G'],
'G' : ['F','S'],
'H' : ['E','G'],
'S' : ['A','C','G']
}
def dfs(graph, node, visited):
if node not in visited:
visited.append(node)
for n in graph[node]:
dfs(graph,n, visited)
return visited
visited = dfs(graph1,'A', [])
print(visited)
Tanpa rekursi:
def dfs(graph, node):
dikunjungi = [simpul]
stack = [node]
while stack:
node = stack[-1]
if node tidak ada di visited:
dikunjungi.extend(node)
remove_from_stack = True
for next di graph[node]:
if next tidak ada di visited:
stack.extend(next)
remove_from_stack = False
break
if remove_from_stack:
stack.pop()
kembali dikunjungi
print (dfs(graph1, 'A'))
```
Keluaran:
```
['A', 'B', 'S', 'C', 'D', 'E', 'H', 'G', 'F']
```
Implementasi DFS dalam Python
from collections import defaultdict
class Graph:
def __init__(self):
self.graph = defaultdict(list)
def addEdge(self, u, v):
self.graph[u].append(v)
def DFSUtil(self, v, visited):
visited[v]=True
print(v)
for i in self.graph[v]:
if visited[i] == False:
self.DFSUtil(i, visited)
def DFS(self):
V = len(self.graph)
visited = [False]*(V)
for i in range(V):
if visited[i] == False:
self.DFSUtil(i, visited)
# Driver code
# Create a graph given in the above diagram
g = Graph()
g.addEdge(0, 1)
g.addEdge(0, 2)
g.addEdge(1, 2)
g.addEdge(2, 0)
g.addEdge(2, 3)
g.addEdge(3, 3)
print("Following is Depth First Traversal")
g.DFS()
Sumber ::: ini