forked from psounis/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtemp.py
More file actions
84 lines (66 loc) · 2.29 KB
/
temp.py
File metadata and controls
84 lines (66 loc) · 2.29 KB
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
from queue import Queue
class Node:
def __init__(self, descr="", neighbors=None):
self.descr = descr
if neighbors is None:
self.neighbors = []
else:
self.neighbors = neighbors
class Graph:
def __init__(self):
self.nodes=[]
def add_vertex(self, descr="", neighbors=None):
if neighbors is None:
neighbors = []
self.nodes.append(Node(descr, neighbors))
def index_of(self, descr):
for i in range(len(self.nodes)):
if descr == self.nodes[i].descr:
return i
return -1
def add_edge(self, descr1, descr2):
index1 = self.index_of(descr1)
index2 = self.index_of(descr2)
self.nodes[index1].neighbors.append(self.nodes[index2])
self.nodes[index2].neighbors.append(self.nodes[index1])
def neighbors(self, descr):
return self.nodes[self.index_of(descr)].neighbors
def __str__(self):
st = ""
for node in self.nodes:
st += f"\n{node.descr}: "
for neighbor in node.neighbors:
st += f"{neighbor.descr} "
return st
def breadth_first_search(graph, start, finish):
q = Queue()
discovered = [start]
q.enqueue(start)
parent = {}
while len(q)>0:
v = q.dequeue()
if v == finish:
break
for neighbor in graph.neighbors(v):
if neighbor.descr not in discovered:
discovered += [neighbor.descr]
parent[neighbor.descr] = v
q.enqueue(neighbor.descr)
path = [finish]
while path[0] != start:
path = [parent[path[0]]] + path
print(path)
def main():
facebook_users = Graph()
for user in ["Bob", "Anne", "Elisa", "Diana", "Carl"]:
facebook_users.add_vertex(user)
facebook_users.add_edge("Carl", "Diana")
facebook_users.add_edge("Carl", "Elisa")
facebook_users.add_edge("Carl", "Bob")
facebook_users.add_edge("Diana", "Bob")
facebook_users.add_edge("Diana", "Anne")
facebook_users.add_edge("Elisa", "Anne")
facebook_users.add_edge("Anne", "Bob")
print(facebook_users)
breadth_first_search(facebook_users, "Anne", "Diana")
main()