原題與已知條件
finite loop-free directed network、逐edge capacity與逐internal-vertex conservation。操作=flow-capacity-audit;資料={"vertices":["s0","a0","t0","u0"],"edges":[["s0","a0"],["a0","s0"],["a0","t0"],["t0","a0"]],"source":"s0","sink":"t0","capacities":[5,5,5,5],"flows":[-1,2,3,1]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
G001 — finite loop-free directed network、逐edge capacity與逐internal-vertex conservation。操作=flow-capacity-audit;資料={"vertices":["s0","a0","t0","u0"],"edges":[["s0","a0"],["a0","s0"],["a0","t0"],["t0","a0"]],"source":"s0","sink":"t0","capacities":[5,5,5,5],"flows":[-1,2,3,1]}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。
逐步推導
S001 · implies
操作前
source roles = [flow-capacity-audit]
操作後
derived = [[source, sink, edge_capacity_flow_rows, capacity_rows, capacity_feasible, first_failed_edge_or_null, certificate]]
條件:無
本頁列完整來源欄序,不需JavaScript;gradient boundary依原mode選6/8/7欄,不補欄也不由答案猜mode。
步驟識別與依賴
規則:source_ordered_fields_without_JS · 依賴:G001
S002 · implies
操作前
source roles = [[s0, a0, t0, u0], [[s0, a0], [a0, s0], [a0, t0], [t0, a0]], [5, 5, 5, 5], [-1, 2, 3, 1], s0, t0]
操作後
derived = [[a0, s0, t0, u0], [[[a0, s0], 5, 2], [[a0, t0], 5, 3], [[s0, a0], 5, -1], [[t0, a0], 5, 1]], 2, 是]
條件:無
先依原index配好edge/capacity/flow,再按來源English canonical(edge)序排;vertices用UTF16。反向邊是不同edge,zero容量與孤立點合法,負flow保留供容量判失敗,不修改。
步驟識別與依賴
規則:Flow_zip_source_edges_capacities_flows_BEFORE_order · 依賴:G001, S001
S003 · implies
操作前
source roles = [0, [a0, s0], 2, 5]
操作後
derived = [是, 是, 是]
條件:無
每條有向邊都要0<=flow<=capacity;網路signature合格並不保證候選flow可行。
步驟識別與依賴
規則:Flow_EACH_edge_two_sided_capacity_obligation · 依賴:G001, S002
S004 · implies
操作前
source roles = [1, [a0, t0], 3, 5]
操作後
derived = [是, 是, 是]
條件:無
每條有向邊都要0<=flow<=capacity;網路signature合格並不保證候選flow可行。
步驟識別與依賴
規則:Flow_EACH_edge_two_sided_capacity_obligation · 依賴:G001, S003
S005 · implies
操作前
source roles = [2, [s0, a0], -1, 5]
操作後
derived = [否, 是, 否]
條件:無
每條有向邊都要0<=flow<=capacity;網路signature合格並不保證候選flow可行。
步驟識別與依賴
規則:Flow_EACH_edge_two_sided_capacity_obligation · 依賴:G001, S004
S006 · implies
操作前
source roles = [3, [t0, a0], 1, 5]
操作後
derived = [是, 是, 是]
條件:無
每條有向邊都要0<=flow<=capacity;網路signature合格並不保證候選flow可行。
步驟識別與依賴
規則:Flow_EACH_edge_two_sided_capacity_obligation · 依賴:G001, S005
S007 · calculation
操作前
Flow ALL incoming at vertex a0 := sum(-1, 1)
操作後
Flow ALL incoming at vertex a0 = 0
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S006
S008 · calculation
操作前
Flow ALL outgoing at vertex a0 := sum(2, 3)
操作後
Flow ALL outgoing at vertex a0 = 5
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S007
S009 · implies
操作前
source roles = [a0, [2, 3], [0, 1]]
操作後
derived = [0, 5, 否, 是]
條件:無
入邊/出邊各依完整清單加總;孤立點是0=0。守恆只要求internal vertices,源匯仍計完整balance以求net值。
步驟識別與依賴
規則:Flow_EACH_vertex_complete_directional_incidence · 依賴:G001, S008
S010 · calculation
操作前
Flow ALL incoming at vertex s0 := sum(2)
操作後
Flow ALL incoming at vertex s0 = 2
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S009
S011 · calculation
操作前
Flow ALL outgoing at vertex s0 := sum(-1)
操作後
Flow ALL outgoing at vertex s0 = -1
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S010
S012 · implies
操作前
source roles = [s0, [0], [2]]
操作後
derived = [2, -1, 否, 否]
條件:無
入邊/出邊各依完整清單加總;孤立點是0=0。守恆只要求internal vertices,源匯仍計完整balance以求net值。
步驟識別與依賴
規則:Flow_EACH_vertex_complete_directional_incidence · 依賴:G001, S011
S013 · calculation
操作前
Flow ALL incoming at vertex t0 := sum(3)
操作後
Flow ALL incoming at vertex t0 = 3
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S012
S014 · calculation
操作前
Flow ALL outgoing at vertex t0 := sum(1)
操作後
Flow ALL outgoing at vertex t0 = 1
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S013
S015 · implies
操作前
source roles = [t0, [1], [3]]
操作後
derived = [3, 1, 否, 否]
條件:無
入邊/出邊各依完整清單加總;孤立點是0=0。守恆只要求internal vertices,源匯仍計完整balance以求net值。
步驟識別與依賴
規則:Flow_EACH_vertex_complete_directional_incidence · 依賴:G001, S014
S016 · calculation
操作前
Flow ALL incoming at vertex u0 := sum()
操作後
Flow ALL incoming at vertex u0 = 0
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S015
S017 · calculation
操作前
Flow ALL outgoing at vertex u0 := sum()
操作後
Flow ALL outgoing at vertex u0 = 0
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S016
S018 · implies
操作前
source roles = [u0, [], []]
操作後
derived = [0, 0, 是, 是]
條件:無
入邊/出邊各依完整清單加總;孤立點是0=0。守恆只要求internal vertices,源匯仍計完整balance以求net值。
步驟識別與依賴
規則:Flow_EACH_vertex_complete_directional_incidence · 依賴:G001, S017
S019 · calculation
操作前
Flow source NET outflow not gross outgoing := sub(-1, 2)
操作後
Flow source NET outflow not gross outgoing = -3
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S018
S020 · calculation
操作前
Flow sink NET inflow not gross incoming := sub(3, 1)
操作後
Flow sink NET inflow not gross incoming = 2
條件:無
依原題角色與已證中間量精確代值;分母先核非零,不以近似數替代。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S019
S021 · implies
操作前
source roles = [s0, t0, [[[a0, s0], 2, 5, 是], [[a0, t0], 3, 5, 是], [[s0, a0], -1, 5, 否], [[t0, a0], 1, 5, 是]], [[a0, 0, 5, 否], [u0, 0, 0, 是]], -3, 2]
操作後
derived = [否, 否, 否, 否, 否]
條件:無
全vertex總in−out中每edge相消,故全部internal守恆必得兩net相等;反向不成立,internal imbalance可互抵。容量、逐點守恆、兩net值分別核,feasible不推出maximum/min-cut。最後No是不提供最優證書,不否定特例恰好最優。
步驟識別與依賴
規則:Flow_value_capacity_conservation_and_maximum_separate · 依賴:G001, S020
結論
(s0, t0, [[[a0, s0], 5, 2], [[a0, t0], 5, 3], [[s0, a0], 5, -1], [[t0, a0], 5, 1]], [[[a0, s0], 2, 5, 是], [[a0, t0], 3, 5, 是], [[s0, a0], -1, 5, 否], [[t0, a0], 1, 5, 是]], 否, [[s0, a0], -1, 5, 否], every_edge_requires_zero_less_equal_flow_less_equal_capacity)
依上列完整代值及條件核對得到原題答案;原題編號、格式與狀態保持不變。