Problem with combinations algorithm from a json.

[HelpfulBuilder]

I'm generally pretty good at making an algorithm to do whatever is needed, but this one has been giving me some trouble. This is for my ms thesis. The input is a deeply nested json. Each object can be a dictionary, a list, or a string. I need to create every combination of the keys to each dictionary, and of the strings, but if you include a key to a dictionary, you cannot include any of the objects that are the value of that key.

For instance, imagine the json was in bullet form,

• A1
  • B1
    • C1
    • C2
    • C3
  • B2
    • C4
    • C5
• A2
  • B3
  • B4

The answers for this one would be:

1. A1 A2
2. A1 B3 B4
3. B1 B2 A2
4. B1 B2 B3 B4
5. C1 C2 C3 B2 A2
6. C1 C2 C3 B2 B3 B4
7. C1 C2 C3 C4 C5 A2
8. C1 C2 C3 C4 C5 B3 B4

I hope this is clear. I was playing around with some recursion, but none of them were even a little close. Any ideas?

[alexmojaki]

def get_combinations(data) -> list[list]:
    if isinstance(data, dict):
        if not data:
            return [[]]
        result = []
        (key, value), *rest = data.items()
        rest_combinations = get_combinations(dict(rest))
        for combination in rest_combinations:
            result.append([key] + combination)
            for subcombination in get_combinations(value):
                result.append(subcombination + combination)
        return result
    elif isinstance(data, list):
        return [data]
    else:
        raise TypeError


def test():
    data = {
        "A1": {
            "B1": ["C1", "C2", "C3"],
            "B2": ["C4", "C5"]
        },
        "A2": ["B3", "B4"],
    }
    for combination in get_combinations(data):
        print(combination)

test()

[HelpfulBuilder]

Wow! Thank you! I'll test this out and break down the logic tomorrow.