ass1

Asssignment

main.py 

from read_input import read_input

from mk_sched import mk_sched

import argparse

def print_sched(sched, F_Cost):

    day = 1

    total = 0

    for tasks, menu in sched:

        print(f"Day {day}:")

        for t in tasks:

            print(f"  A{t.id} - {t.food}")

        cost = sum(F_Cost[i] * q for i, q in menu.items())

        print(f"  Menu: {menu}")

        print(f"  Cost: {cost}\n")

        total += cost

        day += 1

    print(f"Total Cost: {total}")

   

def main():

    parser = argparse.ArgumentParser(description="Generate task schedule from a .dag file.")

    parser.add_argument('-f', '--file', required=True, help="Path to the input .dag file")

    args = parser.parse_args()

    asgs, g_sz, books, outs,F_Cost = read_input(f'./assg01/testcases/{args.file}')

    sched = mk_sched(asgs, g_sz, F_Cost)

    print_sched(sched, F_Cost)

if __name__ == "__main__":

    main()

read_input.py

from collections import defaultdict

class Asg:

    def __init__(self, id, in1, in2, out, food):

        self.id = id

        self.in1 = in1

        self.in2 = in2

        self.out = out

        self.food = food

        self.deps = []

        self.depd = []

    def add_dep(self, dep):

        self.deps.append(dep)

    def add_depd(self, depd):

        self.depd.append(depd)

def read_input(file):

    asgs = {}

    F_Cost = {}

    g_sz = 0

    books = []

    outs = []

    with open(file, 'r') as f:

        for ln in f:

            if ln.startswith("%"):  # drop comments

                continue

            if ln.startswith("C"):  # Food cost

                p = ln.split()

                F_Cost[p[1]] = int(p[2])

            elif ln.startswith("G"):  # Group size

                g_sz = int(ln.split()[1])

            elif ln.startswith("I"):  # Books

                books = list(map(int, ln.split()[1:]))

            elif ln.startswith("O"):  # Outputs

                outs = list(map(int, ln.split()[1:]))

            elif ln.startswith("A"):  # Assignments

                p = ln.split()

                id, in1, in2, out, food = int(p[1]), int(p[2]), int(p[3]), int(p[4]), p[5]

                asg = Asg(id, in1, in2, out, food)

                asgs[id] = asg

                if in1 in asgs:

                    asgs[in1].add_depd(asg)

                if in2 in asgs:

                    asgs[in2].add_depd(asg)

    return asgs, g_sz, books, outs,F_Cost

top_sort.py

from collections import deque

def top_sort(asgs):

    deg = {a.id: 0 for a in asgs.values()}

    for a in asgs.values():

        for d in a.deps:

            deg[a.id] += 1

    q = deque([a.id for a in asgs.values() if deg[a.id] == 0])

    sorted_asgs = []

    while q:

        a_id = q.popleft()

        sorted_asgs.append(a_id)

        for d in asgs[a_id].depd:

            deg[d.id] -= 1

            if deg[d.id] == 0:

                q.append(d.id)

    return sorted_asgs

mk_sched.py

from collections import defaultdict

def mk_sched(asgs, g_sz, F_Cost):

    from top_sort import top_sort

    sorted_asgs = top_sort(asgs)

    sched = []

    curr_day = []

    menu = defaultdict(int)

    for a_id in sorted_asgs:

        a = asgs[a_id]

        if len(curr_day) == g_sz or (a.food in menu and menu[a.food] >= F_Cost[a.food]):

            sched.append((list(curr_day), dict(menu)))

            curr_day = []

            menu = defaultdict(int)

        curr_day.append(a)

        menu[a.food] += 1

    if curr_day:

        sched.append((list(curr_day), dict(menu)))

    return sched

tes1.dag

% Comments % Cost <name> <value> C TC 1 C DF 1 C PM 1 C GJ 1 % Group size G 2 % Inputs - books / notes. It ends with -1 I 1 2 3 4 5 6 -1 % Outputs - final outcome. It ends with -1 O 13 14 17 -1 % Assignment dependency list % A <id> <input1> <input2> <outcome> <Food-name> A 1 1 3 7 TC A 2 4 2 8 TC A 3 1 3 9 TC A 4 2 3 10 PM A 5 7 8 11 TC A 6 4 6 12 TC A 7 6 9 13 PM A 8 10 5 14 GJ A 9 1 11 15 DF A 10 3 12 16 TC A 11 15 16 17 DF