-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathclrs_30_data.py
More file actions
615 lines (574 loc) · 26.5 KB
/
Copy pathclrs_30_data.py
File metadata and controls
615 lines (574 loc) · 26.5 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
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
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
import clrs
import numpy as np
import argparse
from data_schema import schema, tasks
import sys
def pointers_to_list(inp, head=None):
# helper method
pointers = inp.copy()
ordered_list = []
temp_head = head
if head is None:
for i in range(0,len(pointers)):
if pointers[i] == i:
head = i
break
assert head != None
pointers[head] = -1
index_dict = {}
for index, element in enumerate(pointers):
if element in index_dict:
index_dict[element].append(index)
else:
index_dict[element] = [index]
current_list = [head]
while len(current_list) != 0:
current_index = current_list.pop(0)
temp = []
if current_index in index_dict:
temp = sorted(index_dict[current_index])
current_list = current_list + temp
ordered_list.append(current_index)
if len(ordered_list) != len(inp):
print("lengths not equal in pointers to list")
print(f"input {len(inp)}: ", inp)
print(f"output {len(ordered_list)}: ", ordered_list)
if (temp_head is None) or (len(inp)-len(ordered_list) > 1):
print("temp head ", temp_head)
print("lengths not equal in pointers to list ... EXITING")
exit()
return np.array(ordered_list).tolist()
def strong_comp_pointers(inp):
pointers = inp.copy()
ordered_list = []
heads = []
for i in range(0,len(pointers)):
if pointers[i] == i:
heads.append(i)
pointers[i] = -1
assert len(heads) > 0
index_dict = {}
for index, element in enumerate(pointers):
if element in index_dict:
index_dict[element].append(index)
else:
index_dict[element] = [index]
for head in heads:
temp_list = []
current_list = [head]
while len(current_list) != 0:
current_index = current_list.pop(0)
temp = []
if current_index in index_dict:
temp = sorted(index_dict[current_index])
current_list = current_list + temp
temp_list.append(current_index)
ordered_list.append(temp_list)
return ordered_list
def get_dataset(partition="train", alg="bubble_sort", batch_size_inp=1):
ds, num_samples, spec = clrs.create_dataset(folder='CLRS30_v1.0.0', algorithm=alg, split=partition, batch_size=batch_size_inp)
return ds
def insertion_sort(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="insertion_sort")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])) # outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def bubble_sort(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="bubble_sort")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def heap_sort(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="heapsort")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def quick_sort(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="quicksort")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def minimum(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="minimum")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def binary_search(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="binary_search")
inputs = []
outputs = []
targets = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
targets.append(feedback.features.inputs[2].data[0]) # target
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(targets)
return np.array(inputs), np.array(outputs), np.array(targets)
def quick_select(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="quickselect")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def maximum_subarray(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="find_maximum_subarray_kadane")
inputs = []
starts = []
ends = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
starts.append(feedback.outputs[1].data[0])
ends.append(feedback.outputs[0].data[0])
if i >= num_samples-1:
return np.array(inputs), np.array(starts), np.array(ends)
return np.array(inputs), np.array(starts), np.array(ends)
def activity_selection(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="activity_selector")
inputs_f = []
inputs_s = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs_f.append(feedback.features.inputs[0].data[0]) # inputs
inputs_s.append(feedback.features.inputs[2].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs_f), np.array(outputs), np.array(inputs_s)
return np.array(inputs_f), np.array(outputs), np.array(inputs_s)
def task_scheduling(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="task_scheduling")
inputs_d = []
inputs_w = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs_d.append(feedback.features.inputs[0].data[0]) # inputs
inputs_w.append(feedback.features.inputs[2].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs_d), np.array(outputs), np.array(inputs_w)
return np.array(inputs_d), np.array(outputs), np.array(inputs_w)
def matrix_mul(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="matrix_chain_order")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0][1:,1:]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def longest_common_subseq(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="lcs_length")
inputs = []
input_strings = []
outputs = []
outputs_arrows = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
# we rearrange the outputs and take the bottom left corner to get a (4,8,8) matrix
half_dimension = (feedback.outputs[0].data[0].shape[1])//2
temp = np.swapaxes(feedback.outputs[0].data[0],0,2)[:,half_dimension:,:-half_dimension]# i.e. [:,8:,:-8] for train
# We take the first three (8,8) matracies and combine them with the directional meanings
temp2 = ((temp[0]*3)+temp[1]+(temp[2]*2)).T
d = {3:"↖", 1:"↑", 2:"←"}
temp2_arrow = np.vectorize(d.get)(temp2.astype(int))
out = np.array([temp2,temp2_arrow]) # we return both the numbers and the arrow encodings for ease of use
outputs.append(temp2)
outputs_arrows.append(temp2_arrow)
inputs.append(feedback.features.inputs[0].data[0]) # inputs
input_strings.append(feedback.features.inputs[2].data[0]) # inputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(input_strings), np.array(outputs_arrows)
return np.array(inputs), np.array(outputs), np.array(input_strings), np.array(outputs_arrows)
def opt_binary_search_tree(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="optimal_bst")
inputs_p = []
inputs_q = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs_p.append(feedback.features.inputs[0].data[0]) # inputs
inputs_q.append(feedback.features.inputs[2].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0][:-1,1:]) #outputs
if i >= num_samples-1:
return np.array(inputs_p), np.array(outputs), np.array(inputs_q)
return np.array(inputs_p), np.array(outputs), np.array(inputs_q)
def bfs(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="bfs")
inputs = []
outputs = []
starts = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
starts.append(feedback.features.inputs[3].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(starts)
return np.array(inputs), np.array(outputs), np.array(starts)
def dfs(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="dfs")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def topological_sort(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="topological_sort")
inputs = []
outputs = []
output_heads = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(pointers_to_list(feedback.outputs[0].data[0])[::-1]) #outputs
output_heads.append(feedback.outputs[1].data[0])
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(output_heads)
return np.array(inputs), np.array(outputs), np.array(output_heads)
def articulation_points(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="articulation_points")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def bridges(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="bridges")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
out = feedback.outputs[0].data[0]
out = np.where(out == -1, out + 1, out) # map -1's to 0's
outputs.append(out) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def strongly_connected_comps(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="strongly_connected_components")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(strong_comp_pointers(feedback.outputs[0].data[0])) #outputs
if i >= num_samples-1:
return np.array(inputs), outputs
return np.array(inputs), outputs
def kruskal(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="mst_kruskal")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs).astype(int)
return np.array(inputs), np.array(outputs).astype(int)
def prim(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="mst_prim")
inputs = []
outputs = []
starts = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
starts.append(feedback.features.inputs[3].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(starts)
return np.array(inputs), np.array(outputs), np.array(starts)
def bellmanford(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="bellman_ford")
inputs = []
outputs = []
starts = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
starts.append(feedback.features.inputs[3].data[0])
outputs.append(feedback.outputs[0].data[0])
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(starts)
return np.array(inputs), np.array(outputs), np.array(starts)
def dijkstras(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="dijkstra")
inputs = []
outputs = []
starts = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0].tolist()) # inputs
starts.append(feedback.features.inputs[3].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), starts
return np.array(inputs), np.array(outputs), starts
def floydwarshall(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="floyd_warshall")
inputs = []
outputs = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
outputs.append(feedback.outputs[0].data[0].T) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs)
return np.array(inputs), np.array(outputs)
def DAGsp(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="dag_shortest_paths")
inputs = []
outputs = []
starts = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
starts.append(feedback.features.inputs[3].data[0])
temp = feedback.outputs[0].data[0].copy()
temp[temp == np.arange(temp.shape[0])] = -1
temp[np.argmax(feedback.features.inputs[3].data[0])] = -2
outputs.append(temp) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(starts)
return np.array(inputs), np.array(outputs), np.array(starts)
def naive_strings(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="naive_string_matcher")
inputs = []
outputs = []
strings = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
strings.append(feedback.features.inputs[2].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(strings)
return np.array(inputs), np.array(outputs), np.array(strings)
def kmp_strings(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="kmp_matcher")
inputs = []
outputs = []
strings = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
inputs.append(feedback.features.inputs[0].data[0]) # inputs
strings.append(feedback.features.inputs[2].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(inputs), np.array(outputs), np.array(strings)
return np.array(inputs), np.array(outputs), np.array(strings)
def segment_intersect(partition="train", num_samples=1):
print("partition is ", partition)
ds = get_dataset(partition=partition, alg="segments_intersect")
xs = []
outputs = []
ys = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
xs.append(feedback.features.inputs[1].data[0]) # inputs
ys.append(feedback.features.inputs[2].data[0])
outputs.append(feedback.outputs[0].data) #outputs
if i >= num_samples-1:
return np.array(xs), np.array(outputs), np.array(ys)
return np.array(xs), np.array(outputs), np.array(ys)
def graham_scan(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="graham_scan")
xs = []
outputs = []
ys = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
xs.append(feedback.features.inputs[1].data[0]) # inputs
ys.append(feedback.features.inputs[2].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(xs), np.array(outputs), np.array(ys)
return np.array(xs), np.array(outputs), np.array(ys)
def jarvis_march(partition="train", num_samples=1):
ds = get_dataset(partition=partition, alg="jarvis_march")
xs = []
outputs = []
ys = []
for i, feedback in enumerate(ds.as_numpy_iterator()):
xs.append(feedback.features.inputs[1].data[0]) # inputs
ys.append(feedback.features.inputs[2].data[0])
outputs.append(feedback.outputs[0].data[0]) #outputs
if i >= num_samples-1:
return np.array(xs), np.array(outputs), np.array(ys)
return np.array(xs), np.array(outputs), np.array(ys)
def main_caller(name, partition, num_samples):
output_dict = {}
if name == "insertion_sort":
inp, out = insertion_sort(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "bubble_sort":
inp, out = bubble_sort(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "heap_sort":
inp, out = heap_sort(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "quick_sort":
inp, out = quick_sort(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "minimum":
inp, out = minimum(partition, num_samples) # one hot output
output_dict["input"] = inp
output_dict["output"] = np.argmax(out, 1)[:, np.newaxis]
elif name == "binary_search":
inp, out, tar = binary_search(partition, num_samples)# one hot output, single value target
output_dict["input"] = inp
output_dict["output"] = np.argmax(out, 1)[:, np.newaxis]
output_dict["target"] = tar[:, np.newaxis]
elif name == "quick_select":
inp, out = quick_select(partition, num_samples) # always trying to find median, one hot output
output_dict["input"] = inp
output_dict["output"] = np.argmax(out, 1)[:, np.newaxis]
elif name == "maximum_subarray":
inp, out, tar = maximum_subarray(partition, num_samples) # returns inputs, starts, ends, starts, ends one hot
output_dict["input"] = inp
output_dict["start"] = np.argmax(out, 1)[:, np.newaxis]
output_dict["end"] = np.argmax(tar, 1)[:, np.newaxis]
elif name == "activity_selection":
inp, out, tar = activity_selection(partition, num_samples) # returns inputs_f, outputs, inputs_s, outputs one hot encoded
output_dict["input_f"] = inp
output_dict["input_s"] = tar
indices_list = [np.where(row == 1)[0].tolist() for row in out]
output_dict["output"] = indices_list
elif name == "task_scheduling":
inp, out, tar = task_scheduling(partition, num_samples) # returns inputs_d, outputs, inputs_w, outputs one hot
output_dict["input_d"] = inp
output_dict["input_w"] = tar
indices_list = [np.where(row == 1)[0].tolist() for row in out]
output_dict["output"] = indices_list
elif name == "matrix_chain_mul":
inp, out = matrix_mul(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "longest_common_subseq":
inp, out, tar, out_arrows = longest_common_subseq(partition, num_samples) # returns inputs_d, outputs, input_strings
output_dict["input_d"] = inp
output_dict["input_string"] = tar
output_dict["output"] = out
output_dict["output_arrows"] = out_arrows
elif name == "opt_bst":
inp, out, tar = opt_binary_search_tree(partition, num_samples) # returns inputs_p, outputs, inputs_q
output_dict["input_p"] = inp
output_dict["input_q"] = tar
output_dict["output"] = out
elif name == "bfs":
inp, out, tar = bfs(partition, num_samples) # returns inputs, outputs, starting nodes (one hot encoded)
output_dict["input"] = inp
output_dict["start"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "dfs":
inp, out = dfs(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "topological_sort":
inp, out, tar = topological_sort(partition, num_samples) # returns inputs, outputs, output heads (one hot)
output_dict["input"] = inp
output_dict["output_head"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "articulation_points":
inp, out = articulation_points(partition, num_samples) # output is 1 for articulation nodes
output_dict["input"] = inp
indices_list = [np.where(row == 1)[0].tolist() for row in out]
output_dict["output"] = indices_list # is list not numpy array
elif name == "bridges":
inp, out = bridges(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "strongly_connected_comps":
inp, out = strongly_connected_comps(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "kruskal":
inp, out = kruskal(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "prim":
inp, out, tar = prim(partition, num_samples) # returns inputs, outputs, starting node (one hot)
output_dict["input"] = inp
output_dict["start"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "bellman_ford":
inp, out, tar = bellmanford(partition, num_samples) # returns inputs, outputs, starting node (one hot)
output_dict["input"] = inp
output_dict["start"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "dijkstras":
inp, out, tar = dijkstras(partition, num_samples) # returns inputs, outputs, starting node (one hot)
output_dict["input"] = inp
output_dict["start"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "floyd_warshall":
inp, out = floydwarshall(partition, num_samples)
output_dict["input"] = inp
output_dict["output"] = out
elif name == "DAG_sp":
inp, out, tar = DAGsp(partition, num_samples) # returns input, output, start node (one hot)
output_dict["input"] = inp
output_dict["start"] = np.argmax(tar, 1)[:, np.newaxis]
output_dict["output"] = out
elif name == "naive_strings":
inp, out, tar = naive_strings(partition, num_samples) # returns inputs, outputs (one hot), strings
output_dict["input"] = inp
output_dict["string"] = tar
output_dict["output"] = np.argmax(out, 1)[:, np.newaxis]
elif name == "kmp_strings":
inp, out, tar = kmp_strings(partition, num_samples)
output_dict["input"] = inp
output_dict["string"] = tar
output_dict["output"] = np.argmax(out, 1)[:, np.newaxis]
elif name == "segment_intersect":
inp, out, tar = segment_intersect(partition, num_samples) # returns x, outputs, y
output_dict["x"] = inp
output_dict["y"] = tar
output_dict["output"] = out
elif name == "graham_scan":
inp, out, tar = graham_scan(partition, num_samples) # returns x, outputs, y
output_dict["x"] = inp
output_dict["y"] = tar
indices_list = [np.where(row == 1)[0].tolist() for row in out]
output_dict["output"] = indices_list
elif name == "jarvis_march":
inp, out, tar = jarvis_march(partition, num_samples) # returns x, outputs, y
output_dict["x"] = inp
output_dict["y"] = tar
indices_list = [np.where(row == 1)[0].tolist() for row in out]
output_dict["output"] = indices_list
else:
print("name not found")
exit()
for key in output_dict:
if isinstance(output_dict[key], list):
output_dict[key] = output_dict[key]
else:
output_dict[key] = output_dict[key].tolist()
return output_dict