Simple Dependency graph / Transitive closure [python]

transitive.py

def dependencies(partials):
    shallow_dep_list = { m.name: m.inherits for m in partials }
    def transitive1(otl):
        deps = []
        rest = list(shallow_dep_list[otl])
        while rest:
            e = rest.pop()
            deps.append(e)
            rest += [d for d in shallow_dep_list[e] if d not in deps]
        return deps
    return { k: transitive1(k) for k in shallow_dep_list }

import pprint
from collections import namedtuple
Node = namedtuple("Node", ["name", "inherits"])

pprint.pprint(dependencies([
    Node("foo", []),        # No dependency
    Node("bar", ["foo"]),   # <-- Direct
    Node("baz", ["bar"]),   # <-- Transitive
    Node("spam", ["eggs"]), # <-- Cycle!
    Node("eggs", ["spam"]), # <-- Cycle!
]))