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