Account for every path through a junction¶
Cross-Domain EchoesShared pattern · Conservation Laws
Two branches bring current into a circuit node; outgoing branches must account for it under the node model. A routing problem makes a similar demand at an internal transfer node: flow cannot appear or vanish there unless the model explicitly gives that node supply, demand or storage. The correspondence is the balance relation, not the whole system. A circuit also obeys electrical element and voltage laws; a minimum-cost flow problem also imposes capacities and chooses a routing objective. Drawing the shared bookkeeping makes a useful question visible: if input and output do not match, what omitted source, sink or accumulation would explain the difference?
Choose a role to see its counterpart in both examples. The diagrams show relationships, not measured quantities.
Circuit theory
An internal circuit node
Read Electrical networkDomain-specific abstraction
At a lumped node without modeled charge accumulation, signed incoming and outgoing currents balance.
In this example: The drawing isolates current balance. Element behavior and voltage constraints are still needed to solve the circuit.
Operations research
An internal routing node
Read Minimum-cost flow problemDomain-specific abstraction
At a transit node with zero supply or demand, a feasible flow sends onward the quantity that arrives.
In this example: This is an imposed feasibility constraint. The minimum-cost objective chooses among feasible routings.
Contributions must use compatible units and a consistent sign convention.
Written comparison
What enters
Circuit theory
Signed incoming branch currents
Operations research
Incoming routed quantities
Contributions must use compatible units and a consistent sign convention.
The junction condition
Circuit theory
No charge accumulation in the selected node model
Operations research
Zero net supply or demand at this transit node
Both selected nodes satisfy a zero-net-flow balance. The physical and optimization reasons for imposing it differ.
What leaves
Circuit theory
Outgoing branch current
Operations research
Outgoing routed quantity
The outgoing total must account for the incoming total under the declared zero-accumulation conditions.
What carries across
Before explaining a mismatch, check the boundary: conservation or a flow-balance constraint requires every source, sink and accumulation to be accounted for.
Where the comparison stops
The shared relation balances incoming and outgoing quantities. Electrical behavior and optimization objectives remain different constraints around it.
- Physical charge conservation is not a claim that every abstract flow problem is a physical system.
- Kirchhoff voltage relations and component laws do not transfer to a generic routing graph.
- Cost minimization is an additional optimization objective; a current-balanced circuit is not thereby the minimum-cost route.
Conditions for this comparison
- Compare internal nodes with no net source, sink or modeled accumulation.
- Use consistent flow units and signs.
- Only the node-balance relation is mapped.
Source entries
Shared pattern
Conservation Laws
Prime
Core Idea
A conservation law is a statement that a specifiable quantity associated with a system remains constant in time whenever the system is isolated from external flows of that quantity — any apparent change must therefore be accounted for by exchange across the system boundary, transformation into other forms, or accumulation in reservoirs.
Circuit theory
Electrical network
Domain-specific abstraction
Core Idea
Kirchhoff current and voltage constraints couple branch relations, producing algebraic or differential equations for currents, voltages and power.
Operations research
Minimum-cost flow problem
Domain-specific abstraction
Core Idea
Minimum-cost flow finds a feasible network flow of specified value or supplies that minimizes the sum of edge cost times flow.
Structural Signature
a directed graph, source and sink or node supplies, edge capacities and unit costs, flow variables, conservation constraints, required flow value and objective