source.py

# https://github.com/BaseMax/BinaryTreeDiagram
import itertools, graphviz as gvz
from math import log2, floor
matrix = {
    "xyz": (0, 1, 2, 3, 4, 5, 6, 7),
    "xzy": (0, 1, 4, 5, 2, 3, 6, 7),
    "yxz": (0, 1, 4, 5, 2, 3, 6, 7),
    "yzx": (0, 4, 1, 5, 2, 6, 3, 7),
    "zxy": (0, 2, 4, 6, 1, 3, 5, 7),
    "zyx": (0, 4, 2, 6, 1, 5, 3, 7),
}

combf = list(map(lambda x: int(x),input('Enter all of minterms in one line with space:').split()))
combf.sort()

def merge(lst):
    res = []
    for i in range(0, len(lst) - 1, 2):
        res.append((lst[i], lst[i + 1]))
    return res

def make_form(combf, fulltree):
    res = []
    for i in range(len(matrix[form])):
        if matrix[form][i] in combf:
            res.append(matrix[form][i])
        else:
            res.append(None)
    while (len(res) > 1):
        res = merge(res)
    return res[0]

def find_best_poly(combf, fulltree, w=0):
    new_combf = []
    for element in combf:
        if element in fulltree:
            new_combf.append(element)
            w += 1
    if len(new_combf) < 2:
        return w
    return find_best_poly(list(itertools.combinations(new_combf, 2)),merge(fulltree), w)

def draw(tree, g, form, h=1):
    if (hasattr(tree, "__iter__")):
        
        l = draw(tree[0], g, form, 2 * h)
        r = draw(tree[1], g, form, 2 * h + 1)

        if l == r and r != (1, 1):

            g.node(f'{h}',f'{l[0]}',style="invis" if l==(0,0) else None)
            
            g.node(f'{2*h}',f'{l[0]}',style="invis")
            g.edge(f'{h}',f'{2*h}',style="invis")
            
            g.node(f'{2*h+1}',f'{r[0]}',style="invis")
            g.edge(f'{h}',f'{2*h+1}',style = "invis")
            
            return l
        
        g.node(f'{h}', f'{form[floor(log2(h))]}')

        g.node(f'{2*h}',f'{form[floor(log2(2*h))]}'  if l[1] else f'{l[0]}' ,style=None if l[0] else "invis")
        g.edge(f'{h}', f'{2*h}',style="dashed" if l[0] else "invis" )
        
        g.node(f'{2*h+1}',f'{form[floor(log2(2*h+1))]}'  if r[1] else f'{r[0]}',style=None if r[0] else "invis")
        g.edge(f'{h}', f'{2*h+1}',style=None if r[0] else "invis")
        
        return (1, 1)

    return (1, 0) if type(tree) == int else (0, 0)

if __name__ == "__main__":
    weight = {
        fulltree[0]: find_best_poly(list(itertools.combinations(combf, 2)),merge(fulltree[1]))
        for fulltree in matrix.items()
    }
    form = list(weight.keys())[list(weight.values()).index(max(weight.values()))]
    print(form)
    g = gvz.Graph(format="png",filename="btree.gv")
    draw(make_form(combf, matrix[form]), g, form)
    print(g.source)
    g.view()