用于实现表示树的父(子)子关系的矩阵的Python程序

class TreeMatrix:
    def __init__(self, n):
        self.matrix = [[0] * n for _ in range(n)]
        self.n = n

    def add_relationship(self, parent, child):
        self.matrix[parent][child] = 1

    def get_children(self, parent):
        children = []
        for i in range(self.n):
            if self.matrix[parent][i] == 1:
                children.append(i)
        return children

    def get_parent(self, child):
        for i in range(self.n):
            if self.matrix[i][child] == 1:
                return i
        return None

# 示例用法
tree = TreeMatrix(5)
tree.add_relationship(0, 1)
tree.add_relationship(0, 2)
tree.add_relationship(1, 3)
tree.add_relationship(1, 4)

print(tree.get_children(0))  # 输出: [1, 2]
print(tree.get_parent(3))  # 输出: 1