With nonnegative edges, the unsettled vertex of minimum tentative distance already has its true shortest-path distance. I want the notation, the mechanism, and the failure mode visible at the same time.
Start locally
Weighted paths minimize \(\sum_{e\in P}w(e)\), flows use values \(f:E\to\mathbf R_{\ge0}\) with conservation, and matchings enforce degree at most one. Each problem has a dual obstruction.
There are two layers here: the object \(\mathsf D\) and the law \(\mathsf C\). Writing them separately makes the direction of \(\Longrightarrow\) visible and keeps an accidental converse from slipping in.
Compute before generalising
An explicit case prevents the notation from becoming ceremonial. Every subscript and superscript in the display contributes to the value.
The global view
The formula is reusable precisely because it says which pieces are structural and which belong only to the worked example.
Edge conditions
Dijkstra requires nonnegative edge weights, while flow capacities must be interpreted on a directed residual network even when the original graph is undirected.
The notation is dense, but it is doing honest work: every delimiter records scope and every index records dependence. Removing one should require a mathematical reason.