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