/
main_gui.py
384 lines (350 loc) · 14.8 KB
/
main_gui.py
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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
'''
A GUI wrapper class of degrees of wikipedia
Reference:
The skeleton of this program is form this
link[https://docs.python.org/3/library/tkinter.html#tkinter-life-preserver]
with some changes.
'''
import datetime
import subprocess
import tkinter as tk
import networkx as nx
import matplotlib
matplotlib.use("TkAgg")
import matplotlib.pyplot as plt
from networkx.drawing.nx_agraph import write_dot
from searcher import Searcher
from searcher_common import CommonAncestorsSearcher
from log import debug_log, log
import settings
import fileio
class WikiApp(tk.Frame):
'''GUI version of degree of wikipedia
'''
_BACKGROUND_COLOR = 'white'
def __init__(self, master=None):
super().__init__(master)
self.configure(background=self._BACKGROUND_COLOR)
self.start_lemma_name = ''
self.end_lemma_name = ''
self.max_page_limit = 0
self.pack()
self.create_widges()
self._help()
def create_widges(self):
'''create widges.
'''
self.welcome_label = tk.Label(self,
text='Welcome to Degrees of Wikipedia!',
bg=self._BACKGROUND_COLOR)
self.start_label = tk.Label(self,
text='Start at: ',
bg=self._BACKGROUND_COLOR)
self.end_label = tk.Label(self,
text='End at: ',
bg=self._BACKGROUND_COLOR)
self.start_entry = tk.Entry(self)
self.end_entry = tk.Entry(self)
self.limit_label = tk.Label(self,
text='Max. Page: ',
bg=self._BACKGROUND_COLOR)
self.limit_entry = tk.Entry(self)
self.start_button = tk.Button(self,
text='Start',
command=self.start_search,
bg=self._BACKGROUND_COLOR)
self.exit_button = tk.Button(self,
text="Exit",
command=root.destroy,
bg=self._BACKGROUND_COLOR)
self.result_text = tk.Text(self, width=40, height=10,
bg=self._BACKGROUND_COLOR)
# add widges to frame
self.welcome_label.grid(columnspan=4)
self.start_label.grid(row=1, column=0)
self.start_entry.grid(row=1, column=1, columnspan=3)
self.end_label.grid(row=2, column=0)
self.end_entry.grid(row=2, column=1, columnspan=3)
self.limit_label.grid(row=3, column=0)
self.limit_entry.grid(row=3, column=1, columnspan=3)
self.start_button.grid(row=4, column=1)
self.exit_button.grid(row=4, column=2, sticky=tk.W)
self.result_text.grid(columnspan=2)
def display_text(self, content):
'''Display `content` in Tk.Text widget.
'''
self.result_text.insert(tk.END, content)
def clear_text(self):
'''Clean up text area.
'''
self.result_text.delete(1.0, tk.END)
def render(self, nx_graph, path_list, figure=plt):
'''Draw graph, store dot file, convert dot to pdf.
'''
#################
# draw graph####
#################
img_suffix = datetime.datetime.now().strftime('%y%m%d_%H%M%S')
img_name = 'graph_img/graph_img' + img_suffix
dot_name = img_name + '.dot'
if settings.debug:
debug_log('generating {} file...'.format(dot_name))
write_dot(nx_graph, dot_name)
if settings.debug:
debug_log('generating {}.pdf file from .dot'
'file...'.format(dot_name))
# save graph as .png
subprocess.run(['dot', '-Tpdf', '-O', dot_name])
subprocess.run(['open', dot_name+'.pdf'])
log('Rendering graph...')
# nx.draw_spring(nx_graph, node_size=50)
###################################################
# change color of node[ok] and path###
###################################################
start_node = path_list[0]
end_node = path_list[-1]
nx_graph_pos = nx.spring_layout(nx_graph)
nx.draw_networkx(nx_graph, nx_graph_pos,
with_labels=False,
node_size=50)
# change color of nodes along the path
nx.draw_networkx_nodes(nx_graph,
pos=nx_graph_pos,
nodelist=path_list,
node_color='g',
node_size=200)
# change color of end-point nodes
nx.draw_networkx_nodes(nx_graph,
pos=nx_graph_pos,
nodelist=[start_node, end_node],
node_color='b',
node_size=200)
# change path color
path_edge_list = [(path_list[i], path_list[i+1])
for i in range(len(path_list)-1)]
nx.draw_networkx_edges(nx_graph,
pos=nx_graph_pos,
edgelist=path_edge_list,
width=1.0,
edge_color='b')
# write the graph to a file
if settings.debug:
debug_log('storing graph...')
fileio.write_graph(nx_graph.nodes())
fileio.write_graph(nx_graph.edges())
log('Done')
plt.axis('off')
figure.show()
def show_result(self, result):
'''show summary result, render graph, and store graph files.
result: returned value from searcher.result()
Ex: {'degree': 2,
'path': ['macbook', 'apple inc.',
'iphone 6s plus']
'graph':networkx.classes.digraph.Digraph
'''
log(result)
self.clear_text()
self.display_text('Got it!\n')
self.display_text('Degree: ' + str(result['degree']) + '\n')
self.display_text('Path: ')
res_path = result['path']
for (i, node) in enumerate(res_path):
self.display_text(node)
if i != len(res_path) - 1:
self.display_text(' --> ')
self.render(result['graph'], res_path)
def _help(self):
'''Show the usages of the program.
'''
helptext = ('Welome to degrees of wikipedia!\n'
'There is a well-known idea called "six degrees of '
'separation": everything in this world can be connected '
'by 6 steps or less with others. This program simulates '
'this thory in the world of Wikipedia.\n'
'To find the relation between two words, enter them in '
'the \'Start\'(\'Start1\') and \'End\'(\'Start2\') entry.')
self.display_text(helptext)
def do_searching(self):
'''Run search.
'''
# start searching
if not self.max_page_limit:
wiki_searcher = Searcher(self.start_lemma_name,
self.end_lemma_name)
else:
try:
limit_int = int(self.max_page_limit)
except ValueError:
self.display_text('Invallid maximum limit.')
return
wiki_searcher = Searcher(self.start_lemma_name,
self.end_lemma_name,
limit_int)
self.display_text('Busy searching...')
log('Busy searching...')
wiki_searcher.run_search()
# got it, display result
if wiki_searcher.found_target:
self.show_result(wiki_searcher.get_result())
else:
self.clear_text()
self.display_text('Search reach the maximum page limit.\n')
# clean Entry for next search
self.start_entry.delete(0, tk.END)
self.end_entry.delete(0, tk.END)
def start_search(self):
'''main entry of the program: get and check inputs.
'''
self.clear_text()
# get input from Entry
self.start_lemma_name = self.start_entry.get().strip()
self.end_lemma_name = self.end_entry.get().strip()
self.max_page_limit = self.limit_entry.get().strip()
# make sure both text entry has contents
if not (self.start_lemma_name and self.end_lemma_name):
self.display_text('Invalid input. Try again.')
return
self.do_searching()
class WikiCommonAncestorsApp(WikiApp):
'''GUI for finding common ancestors.
'''
def __init__(self, master=None):
super().__init__(master)
self.start1_lemma_name = ''
self.start2_lemma_name = ''
def create_widges(self):
'''create widges.
'''
self.welcome_label = tk.Label(self,
text=('Welcome to Degrees of Wikipedia, '
'find common ancestors!'),
bg=self._BACKGROUND_COLOR)
self.start1_label = tk.Label(self,
text='Start1 at: ',
bg=self._BACKGROUND_COLOR)
self.start2_label = tk.Label(self,
text='Start2 at: ',
bg=self._BACKGROUND_COLOR)
self.start1_entry = tk.Entry(self)
self.start2_entry = tk.Entry(self)
self.limit_label = tk.Label(self,
text='Max. Page: ',
bg=self._BACKGROUND_COLOR)
self.limit_entry = tk.Entry(self)
self.start_button = tk.Button(self,
text='Start',
command=self.start_search,
bg=self._BACKGROUND_COLOR)
self.exit_button = tk.Button(self,
text="Exit",
command=root.destroy,
bg=self._BACKGROUND_COLOR)
self.result_text = tk.Text(self, width=40, height=10,
bg=self._BACKGROUND_COLOR)
# add widges to frame
self.welcome_label.grid(columnspan=4)
self.start1_label.grid(row=1, column=0)
self.start1_entry.grid(row=1, column=1, columnspan=3)
self.start2_label.grid(row=2, column=0)
self.start2_entry.grid(row=2, column=1, columnspan=3)
self.limit_label.grid(row=3, column=0, stick=tk.E)
self.limit_entry.grid(row=3, column=1, columnspan=3)
self.start_button.grid(row=4, column=1)
self.exit_button.grid(row=4, column=2, sticky=tk.W)
self.result_text.grid(columnspan=2)
def show_result(self, result):
'''show summary result, render graph, and store graph files.
result: returned value from searcher.result()
Ex: {'degree': [2, 2]
'path': ['macbook', 'apple inc.',
'iphone 6s plus']
'graph1':networkx.classes.digraph.Digraph
'graph2':networkx.classes.digraph.Digraph
''
'''
log(result)
self.clear_text()
self.display_text('Got it!\n')
self.display_text('Degree: ' + str(result['degree']) + '\n')
self.display_text('Path: ')
res_path1 = result['path'][0]
res_path2 = result['path'][1]
# show path in text format
for (i, node) in enumerate(res_path1):
self.display_text(node)
if i != len(res_path1) - 1:
self.display_text(' --> ')
for (j, node) in enumerate(res_path2[-2::-1]):
if j != len(res_path2) - 1:
self.display_text(' <-- ')
self.display_text(node)
# show all common ancestors
self.display_text('\n==================\n')
self.display_text('Common ancestors are:\n')
for com_ast in result['common_ancestors']:
self.display_text(com_ast)
self.display_text(' ')
figure1 = plt.figure(0)
self.render(result['graph1'], res_path1, figure=figure1)
figure2 = plt.figure(1)
self.render(result['graph2'], res_path2, figure=figure2)
plt.show()
def do_searching(self):
'''Run search.
'''
# start searching
if not self.max_page_limit:
wiki_searcher = CommonAncestorsSearcher(self.start1_lemma_name,
self.start2_lemma_name)
else:
try:
limit_int = int(self.max_page_limit)
except ValueError:
self.display_text('Invallid maximum limit.')
return
wiki_searcher = CommonAncestorsSearcher(self.start1_lemma_name,
self.start2_lemma_name,
limit_int)
self.display_text('Busy searching...')
log('Busy searching...')
# clean Entry for next search
self.start1_entry.delete(0, tk.END)
self.start2_entry.delete(0, tk.END)
wiki_searcher.run_search()
# got it, display result
if wiki_searcher.found_common_ancestor:
self.show_result(wiki_searcher.get_result())
else:
self.clear_text()
if wiki_searcher.invalid_start_point:
self.display_text('Invalid start point.')
else:
self.display_text('Search reach the maximum page limit.\n')
def start_search(self):
'''main entry of the program: get and check inputs.
'''
self.clear_text()
# get input from Entry
self.start1_lemma_name = self.start1_entry.get().strip()
self.start2_lemma_name = self.start2_entry.get().strip()
self.max_page_limit = self.limit_entry.get().strip()
if not (self.start1_lemma_name and self.start2_lemma_name):
self.display_text('Invalid input. Try again.')
return
self.do_searching()
if __name__ == '__main__':
root = tk.Tk()
root.title('Degrees Of WikiPedia')
root.geometry('800x640')
root.configure(background='white')
print('Welcome to degrees of wikiepedia!')
which_app = input('1. Find path, 2. Find common ancestors: ').strip()
while not which_app.isdigit() or not int(which_app) in (1, 2):
log('invalid input. Please press 1 or 2.')
which_app = input('1. Find path, 2. Find common ancestors')
if which_app == '1':
app = WikiApp(master=root)
else:
app = WikiCommonAncestorsApp(master=root)
app.mainloop()