p425.1 Generate Graph Algo

p425.1 Generate Graph Algo.py

is_prime = #A list such that is_prime[x] = True if x is prime
primes = #A list containing all the primes. Hint: generate it from is_prime
graph = {}

for k in range(len(primes)):
    p = primes[k]

    digits = []
    while p != 0:
        digits.append(p % 10)
        p //= 10
    digits.append(0)
    digits = digits[::-1]

    p = primes[k]
    for x in range(len(digits)):
        og = digits[x]
        for i in range(og + 1, 10):
            digits[x] = i  
            num = 0
            for y in digits:
                num = 10*num + y

            if num <= primes[-1] and num != p:
                if is_prime[num]:
                    if p in graph:
                        graph[p].append((num, num))
                    else:
                        graph[p] = [(num, num)]

                    if num in graph:
                        graph[num].append((p, num))
                    else:
                        graph[num] = [(p, num)]
        digits[x] = og