Repository navigation
Expand file tree
/
Copy pathGraph.py
More file actions
103 lines (94 loc) · 3.8 KB
/
Copy pathGraph.py
File metadata and controls
103 lines (94 loc) · 3.8 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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
# graph DS to match symptoms with doctors
class Graph:
def __init__(self):
self.graph = {}
def add_node(self, node, node_type):
if node not in self.graph:
self.graph[node] = {"node_type": node_type, "neighbors": []}
def add_edge_doctor(self, node1, node2, node3):
if node1 in self.graph and node2 in self.graph and node3 in self.graph:
self.graph[node1]["neighbors"].append([node2, node3])
self.graph[node2]["neighbors"].append([node1, node3])
self.graph[node3]["neighbors"].append([node1, node2])
def add_edge_disease(self, node1, node2, node3="-", node4="-"):
if (
node1 in self.graph
and node2 in self.graph
and node3 in self.graph
and node4 in self.graph
):
self.graph[node1]["neighbors"].extend([node2, node3, node4])
self.graph[node2]["neighbors"].extend([node1, node3, node4])
self.graph[node3]["neighbors"].extend([node1, node2, node4])
self.graph[node4]["neighbors"].extend([node1, node2, node3])
elif (
node3 not in self.graph
and node2 in self.graph
and node3 in self.graph
and node4 in self.graph
):
self.graph[node1]["neighbors"].extend([node2, node4])
self.graph[node2]["neighbors"].extend([node1, node4])
self.graph[node4]["neighbors"].extend([node1, node2])
elif (
node4 not in self.graph
and node2 in self.graph
and node3 in self.graph
and node4 in self.graph
):
self.graph[node1]["neighbors"].extend([node2, node3])
self.graph[node2]["neighbors"].extend([node1, node3])
self.graph[node3]["neighbors"].extend([node1, node2])
elif (
node1 in self.graph
and node2 in self.graph
and node3 not in self.graph
and node4 not in self.graph
):
self.graph[node1]["neighbors"].extend([node2])
self.graph[node2]["neighbors"].extend([node1])
def find_disease(self, symptoms):
diseases, diseases_all = [], []
for symptom in symptoms:
if symptom in self.graph:
# print(symptom,self.graph[symptom])
for j in self.graph[symptom]["neighbors"]:
diseases_all.append(j)
# print(diseases_all)
for disease in diseases_all:
# print(self.graph[disease])
sym = []
for j in self.graph[disease]["neighbors"]:
if type(j) == str:
sym.append(j)
# print("\n\n",sym,symptoms)
if sorted(sym) == sorted(symptoms) and disease not in diseases:
diseases.append(disease)
if diseases != []:
return diseases
max_count = 1
for disease in diseases_all:
dc = diseases_all.count(disease)
if disease not in diseases:
if dc == max_count:
diseases.append(disease)
elif dc > max_count:
max_count = dc
diseases = [disease]
# diseases.append(disease)
# print(diseases)
if diseases != []:
return diseases
else:
for disease in diseases_all:
if disease not in diseases:
diseases.append(disease)
return diseases
def get_matching_doctors(self, diseases, age):
doctors = []
for disease in diseases:
# print(self.graph[disease]["neighbors"])
for k in self.graph[disease]["neighbors"]:
if len(k) == 2 and k[0][0] <= age <= k[0][1]:
doctors.append(k[1])
return doctors