Commit d9b50b98 authored by Hrishee Shastri's avatar Hrishee Shastri
Browse files

main file

parent 4468b403
import csv
import SBR
import AdaptiveTBS
import TripartiteBinarySort
from itertools import permutations
from math import factorial
import random
Collects routing time data for the algorithms GDC(TBS), GDC(ATBS), and OES.
Spits out the data into csv files in the "/data/" directory.
def perm_to_str(perm):
Converts a given list or tuple permutation to a string in the proper format (comma and space separated line without
if type(perm) is list:
return str(perm).strip('[]')
if type(perm) is tuple:
return str(perm).strip('()')
raise Exception('perm must be a list or a tuple')
def str_to_perm(string):
Converts a string representation of a permutation into a list of ints
return [int(x) for x in string.split(',')]
def new_algs(algs, algnames, nlist):
Adds a new column to the data files for the values of n given in nlist. The column corresponds to the given
algorithm alg. Creates a new file called new_filename with which is a copy of the old data file with the new
column added on.
for n in nlist:
with open('data/len_{:.0f}_perms.csv'.format(n), 'r') as readfile, \
open('data/new_len_{:.0f}_perms.csv'.format(n), 'w', newline='') as writefile:
reader = csv.reader(readfile)
writer = csv.writer(writefile)
firstrow = True
for row in reader:
if firstrow:
assert (all(algname not in row for algname in algnames))
firstrow = False
row += algnames
perm = str_to_perm(row[0])
for alg in algs:
newcost = alg(perm.copy())
print(n, 'complete...')
def new_data_file(alglist, algnames, nlist):
Creates a new data file for the n values given in nlist with columns corresponding to the algorithms given in
assert (len(alglist) == len(algnames))
for n in nlist:
with open('data/len_{:.0f}_perms.csv'.format(n), 'w', newline='') as writefile:
writer = csv.writer(writefile)
firstrow = ['Permutation'] + algnames
ct = 1
ident = [x + 1 for x in range(n)]
for perm in permutations(ident):
row = [perm_to_str(perm)]
for alg in alglist:
ct += 1
if ct % (factorial(n) / n) == 0:
print('{:.0f}% complete'.format(ct / factorial(n) * 100))
def new_rand_perms_file(alglist, algnames, nlist, count):
alglist = list of algorithms as functions that take a single argument L, the list to be sorted
algnames = list of algorithm names, as strings
nlist = list of permutation lengths
count = number of random perms of each length to run algorithms over
Runs each algorithm in alglist on the same random perms and spits the data for
each permutation length X into a csv file called
Note: folder "data/" needs to exist in the top level directory from where
this script is running
assert (len(alglist) == len(algnames))
for n in nlist:
with open('data/len_{:.0f}_random_perms.csv'.format(n), 'w', newline='') as writefile:
writer = csv.writer(writefile)
firstrow = ['Permutation'] + algnames
data = []
for i in range(count):
perm = [x + 1 for x in range(n)]
row = [perm_to_str(perm)]
for alg in alglist:
# writer.writerow(row)
if i % (count // 10) == 0:
print('\t{:.0f}% complete'.format(i / count * 100))
print(n, 'complete')
algnames = ['OES', 'GDC(TBS)', 'GDC(ATBS)']
algs = [SBR.odd_even_sort, TripartiteBinarySort.GDC_TBS, AdaptiveTBS.GDC_ATBS]
new_rand_perms_file(algs, algnames, list(range(LENGTH_FROM,LENGTH_TO + 1)), NUM_PERMS_PER_LENGTH)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment