Step-by-step derivation
S001 · implies
Before
source roles = [flow-capacity-audit]
After
derived = [[source, sink, edge_capacity_flow_rows, capacity_rows, capacity_feasible, first_failed_edge_or_null, certificate]]
Conditions: none
List the source field order without JavaScript.Gradient boundary uses its original mode to choose6,8 or7 fields;no padding or answer-derived mode.
Step identifiers and dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [[s16, a16, t16, u16], [[s16, a16], [a16, s16], [a16, t16], [t16, a16]], [85, 85, 85, 85], [102, 34, 51, 17], s16, t16]
After
derived = [[a16, s16, t16, u16], [[[a16, s16], 85, 34], [[a16, t16], 85, 51], [[s16, a16], 85, 102], [[t16, a16], 85, 17]], 2, Yes]
Conditions: none
Zip edge,capacity and flow by original index before source English canonical-edge sorting;vertices use UTF16.Opposite directions are distinct,zero capacity and isolated vertices are legal,and negative flow is retained for capacity failure rather than rewritten.
Step identifiers and dependencies
Rule: Flow_zip_source_edges_capacities_flows_BEFORE_order · Uses: G001, S001
S003 · implies
Before
source roles = [0, [a16, s16], 34, 85]
After
derived = [Yes, Yes, Yes]
Conditions: none
Every directed edge needs0<=flow<=capacity.A qualified network signature does not imply candidate-flow feasibility.
Step identifiers and dependencies
Rule: Flow_EACH_edge_two_sided_capacity_obligation · Uses: G001, S002
S004 · implies
Before
source roles = [1, [a16, t16], 51, 85]
After
derived = [Yes, Yes, Yes]
Conditions: none
Every directed edge needs0<=flow<=capacity.A qualified network signature does not imply candidate-flow feasibility.
Step identifiers and dependencies
Rule: Flow_EACH_edge_two_sided_capacity_obligation · Uses: G001, S003
S005 · implies
Before
source roles = [2, [s16, a16], 102, 85]
After
derived = [Yes, No, No]
Conditions: none
Every directed edge needs0<=flow<=capacity.A qualified network signature does not imply candidate-flow feasibility.
Step identifiers and dependencies
Rule: Flow_EACH_edge_two_sided_capacity_obligation · Uses: G001, S004
S006 · implies
Before
source roles = [3, [t16, a16], 17, 85]
After
derived = [Yes, Yes, Yes]
Conditions: none
Every directed edge needs0<=flow<=capacity.A qualified network signature does not imply candidate-flow feasibility.
Step identifiers and dependencies
Rule: Flow_EACH_edge_two_sided_capacity_obligation · Uses: G001, S005
S007 · calculation
Before
Flow ALL incoming at vertex a16 := sum(102, 17)
After
Flow ALL incoming at vertex a16 = 119
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
Flow ALL outgoing at vertex a16 := sum(34, 51)
After
Flow ALL outgoing at vertex a16 = 85
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · implies
Before
source roles = [a16, [2, 3], [0, 1]]
After
derived = [119, 85, No, Yes]
Conditions: none
Sum all incoming and outgoing edges separately;an isolated vertex has0=0.Conservation is required only internally,but compute source/sink balances too for net values.
Step identifiers and dependencies
Rule: Flow_EACH_vertex_complete_directional_incidence · Uses: G001, S008
S010 · calculation
Before
Flow ALL incoming at vertex s16 := sum(34)
After
Flow ALL incoming at vertex s16 = 34
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
Flow ALL outgoing at vertex s16 := sum(102)
After
Flow ALL outgoing at vertex s16 = 102
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · implies
Before
source roles = [s16, [0], [2]]
After
derived = [34, 102, No, No]
Conditions: none
Sum all incoming and outgoing edges separately;an isolated vertex has0=0.Conservation is required only internally,but compute source/sink balances too for net values.
Step identifiers and dependencies
Rule: Flow_EACH_vertex_complete_directional_incidence · Uses: G001, S011
S013 · calculation
Before
Flow ALL incoming at vertex t16 := sum(51)
After
Flow ALL incoming at vertex t16 = 51
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
Flow ALL outgoing at vertex t16 := sum(17)
After
Flow ALL outgoing at vertex t16 = 17
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · implies
Before
source roles = [t16, [1], [3]]
After
derived = [51, 17, No, No]
Conditions: none
Sum all incoming and outgoing edges separately;an isolated vertex has0=0.Conservation is required only internally,but compute source/sink balances too for net values.
Step identifiers and dependencies
Rule: Flow_EACH_vertex_complete_directional_incidence · Uses: G001, S014
S016 · calculation
Before
Flow ALL incoming at vertex u16 := sum()
After
Flow ALL incoming at vertex u16 = 0
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · calculation
Before
Flow ALL outgoing at vertex u16 := sum()
After
Flow ALL outgoing at vertex u16 = 0
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · implies
Before
source roles = [u16, [], []]
After
derived = [0, 0, Yes, Yes]
Conditions: none
Sum all incoming and outgoing edges separately;an isolated vertex has0=0.Conservation is required only internally,but compute source/sink balances too for net values.
Step identifiers and dependencies
Rule: Flow_EACH_vertex_complete_directional_incidence · Uses: G001, S017
S019 · calculation
Before
Flow source NET outflow not gross outgoing := sub(102, 34)
After
Flow source NET outflow not gross outgoing = 68
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S018
S020 · calculation
Before
Flow sink NET inflow not gross incoming := sub(51, 17)
After
Flow sink NET inflow not gross incoming = 34
Conditions: none
Substitute original roles and established intermediates exactly;check nonzero denominators and do not round.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S019
S021 · implies
Before
source roles = [s16, t16, [[[a16, s16], 34, 85, Yes], [[a16, t16], 51, 85, Yes], [[s16, a16], 102, 85, No], [[t16, a16], 17, 85, Yes]], [[a16, 119, 85, No], [u16, 0, 0, Yes]], 68, 34]
After
derived = [No, No, No, No, No]
Conditions: none
Every edge cancels in the sum of all vertex balances,so internal conservation implies equal source/sink net values.The converse fails when internal imbalances cancel.Capacity,each balance and net equality remain separate.Feasibility does not certify maximum/min-cut;No does not deny special optimal examples.
Step identifiers and dependencies
Rule: Flow_value_capacity_conservation_and_maximum_separate · Uses: G001, S020
Result
(s16, t16, [[[a16, s16], 85, 34], [[a16, t16], 85, 51], [[s16, a16], 85, 102], [[t16, a16], 85, 17]], [[[a16, s16], 34, 85, Yes], [[a16, t16], 51, 85, Yes], [[s16, a16], 102, 85, No], [[t16, a16], 17, 85, Yes]], No, [[s16, a16], 102, 85, No], every_edge_requires_zero_less_equal_flow_less_equal_capacity)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.