File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 66from collections import deque
77
88def bfs (graph , start ):
9- visited = set ()
9+ visited = []
1010 queue = deque ([start ])
1111 result = []
1212
1313 while queue :
1414 node = queue .popleft ()
1515 if node not in visited :
16- visited .add (node )
16+ visited .append (node )
1717 result .append (node )
18- queue .extend (set (graph .get (node , [])) - visited )
18+ #queue.extend(graph.get(node, []) - visited)
19+ queue .extend (x for x in graph .get (node , []) if x not in visited )
1920
2021 return result
2122
2223def dfs (graph , start ):
23- visited = set ()
24+ visited = []
2425 stack = [start ]
2526 result = []
2627
2728 while stack :
2829 node = stack .pop ()
2930 if node not in visited :
30- visited .add (node )
31+ visited .append (node )
3132 result .append (node )
32- stack .extend (set ( graph .get (node , [])) - visited )
33+ stack .extend (x for x in graph .get (node , []) if x not in visited )
3334
3435 return result
3536
You can’t perform that action at this time.
0 commit comments