import networkx as nx

def max_unique_paths(graph, source, sink):
    # 创建一个有向图
    G = nx.DiGraph()
    
    # 添加边，容量为1
    for u in graph:
        for v in graph[u]:
            G.add_edge(u, v, capacity=1)
    
    # 使用最大流算法
    flow_value, flow_dict = nx.maximum_flow(G, source, sink)
    
    return flow_value

# 示例图表示为邻接表
graph = {
    1: [2, 3],
    2: [4],
    3: [4],
    4: [5],
    5: []
}

# 查找从节点 1 到节点 n 的最多路径数量
n = 5
max_paths = max_unique_paths(graph, 1, n)
print(max_paths)