用Python实现树形路径算法

class Node:
    def __init__(self, value, parent=None):
        self.value = value
        self.parent = parent
        self.children = []

    def add_child(self, node):
        self.children.append(node)
        node.parent = self

    def get_path(self):
        path = []
        node = self
        while node:
            path.insert(0, node.value)
            node = node.parent
        return path

def find_node(root, value):
    if root.value == value:
        return root
    for child in root.children:
        node = find_node(child, value)
        if node:
            return node
    return None

# 构建一个树形结构
root = Node("pidancode.com")
node1 = Node("blog", root)
node2 = Node("about", root)
node3 = Node("contact", root)
node4 = Node("category1", node1)
node5 = Node("category2", node1)
node6 = Node("page1", node4)
node7 = Node("page2", node4)
node8 = Node("page3", node5)
root.add_child(node1)
root.add_child(node2)
root.add_child(node3)
node1.add_child(node4)
node1.add_child(node5)
node4.add_child(node6)
node4.add_child(node7)
node5.add_child(node8)

# 查找节点的路径
node = find_node(root, "page2")
if node:
    path = node.get_path()
    print("The path of 'page2' is:", " -> ".join(path))
else:
    print("Node not found.")