-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGraphs.py
More file actions
35 lines (27 loc) · 780 Bytes
/
Graphs.py
File metadata and controls
35 lines (27 loc) · 780 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
graph = {'A': set(['B', 'C']),
'B': set(['D', 'E']),
'C': set([ 'F']),
'D': set([]),
'E': set([ 'F']),
'F': set([ 'E'])}
def dfs(graph1,start):
visited,stack = set(),[start]
while stack:
vertex = stack.pop()
if vertex not in visited:
visited.add(vertex)
stack.extend(graph1[vertex] -visited)
return visited
def bfs(graph, start):
visited, queue = set(), [start]
while queue:
vertex = queue.pop(0)
if vertex not in visited:
visited.add(vertex)
queue.extend(graph[vertex] - visited)
return visited
bfs(graph, 'A') # {'B', 'C', 'A', 'F', 'D', 'E'}
print (dfs(graph,'A'))
set1 = set([1,2,3])
set2 = set([2])
print (set1 - set2)