Python计算机视觉第九章-图像分割

import networkx as nx

# 创建一个有向图
G = nx.DiGraph()

# 添加节点和边（源节点、目标节点、容量）
edges = [
    ('s', 'a', 10),
    ('s', 'b', 5),
    ('a', 'b', 15),
    ('a', 't', 10),
    ('b', 't', 10)
]

# 添加边到图中，确保所有边都有容量属性
for u, v, capacity in edges:
    G.add_edge(u, v, capacity=capacity)

# 计算最大流和最小割
try:
    flow_value, flow_dict = nx.maximum_flow(G, 's', 't')
    cut_value, partition = nx.minimum_cut(G, 's', 't')

    print(f"最大流: {flow_v