Graph traversal

quinnlarsson819 22.05.2026 11:42

Graph traversal

Feedback appreciated

solver.py

def is_prime(n):
    if n < 2: return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0: return False
    return True

print(is_prime(17))

test.py

def hello():
    print("Hello, World!")

views.py

def flatten(lst):
    result = []
    for item in lst:
        if isinstance(item, list): result.extend(flatten(item))
        else: result.append(item)
    return result

print(flatten([1, [2, [3, 4]], 5]))

Graph traversal

Are you sure you want to delete this post?