topol algo __ subset combination problem

topol.py

from typing import Callable

# topol algo

tsbst: list = [None]

def subset(sett: list) -> list:
        biN:Callable[str, str] = lambda el : ''.join(reversed([str((el>>i) & 1) for i in range(len(sett))]))
        tpx:int = 2**len(sett)
        for i in range(1,tpx):
                # breakpoint()
                # print(list(biN(i%tpx)))
                yield [i for i,j in zip(sett, list(biN(i%tpx))) if int(bool(i)) is int(j)]


# subset((lambda x : [input() for n in range(int(input("[+] NUMBER OF MEMBER SET : ")))])([]))
for sbst in subset(sys.argv[1].split(",")):
        tsbst.append(set(sbst))


smallestTopol: set = [None, tsbst[len(tsbst)-1]]
largestTopol: list = tsbst

print(f"\n[+] THE LARGEST TOPOLOGY IS\n\n\t {largestTopol}\n")
print(f"[+] THE SMALLEST TOPOLOGY IS\n\n\t {smallestTopol}\n")