Loading

Chat Bot

    摘要: 1. 最大流问题定义 1.1 流网络(Flow network) Def. A ==flow network== is a tuple $G = (V, E, s, t, c)$: Digraph $(V, E)$ with source $s ∈ V$ and sink $t ∈ V$. Capa 阅读全文
    posted @ 2023-02-24 11:44 ㅤJJVVㅤ 阅读(42) 评论(0) 推荐(1) 编辑