Why CLRS example on residual networks does not follows its formula? The 2019 Stack Overflow Developer Survey Results Are InWhy is the complexity of negative-cycle-cancelling $O(V^2AUW)$?CLRS - Maxflow Augmented Flow Lemma 26.1 - don't understand use of def. in proofFord-Fulkerson algorithm clarificationLinear programming formulation of cheapest k-edge path between two nodesWhy is it that the flow value can increased along an augmenting path $p$ in a residual network?Maximum flow with Edmonds–Karp algorithmHow would one construct conjunctively local predicate of order k for checking if a shape is Convex?Equivalence of minimum cost circulation problem and minimum cost max flow problemGiven max-flow determine if edge is in a min-cutWhat is the intuition behind the way of reading off a dual optimal solution from simplex primal tabular in CLRS?

What is the motivation for a law requiring 2 parties to consent for recording a conversation

How to answer pointed "are you quitting" questioning when I don't want them to suspect

Does the shape of a die affect the probability of a number being rolled?

Reference request: Oldest number theory books with (unsolved) exercises?

For what reasons would an animal species NOT cross a *horizontal* land bridge?

Why hard-Brexiteers don't insist on a hard border to prevent illegal immigration after Brexit?

Did 3000BC Egyptians use meteoric iron weapons?

Can you compress metal and what would be the consequences?

Why didn't the Event Horizon Telescope team mention Sagittarius A*?

Does a dangling wire really electrocute me if I'm standing in water?

Falsification in Math vs Science

Where to refill my bottle in India?

Are there incongruent pythagorean triangles with the same perimeter and same area?

Have you ever entered Singapore using a different passport or name?

Can a rogue use sneak attack with weapons that have the thrown property even if they are not thrown?

Right tool to dig six foot holes?

slides for 30min~1hr skype tenure track application interview

If a Druid sees an animal’s corpse, can they Wild Shape into that animal?

Pokemon Turn Based battle (Python)

Is this app Icon Browser Safe/Legit?

Identify boardgame from Big movie

Can one be advised by a professor who is very far away?

FPGA - DIY Programming

Loose spokes after only a few rides



Why CLRS example on residual networks does not follows its formula?



The 2019 Stack Overflow Developer Survey Results Are InWhy is the complexity of negative-cycle-cancelling $O(V^2AUW)$?CLRS - Maxflow Augmented Flow Lemma 26.1 - don't understand use of def. in proofFord-Fulkerson algorithm clarificationLinear programming formulation of cheapest k-edge path between two nodesWhy is it that the flow value can increased along an augmenting path $p$ in a residual network?Maximum flow with Edmonds–Karp algorithmHow would one construct conjunctively local predicate of order k for checking if a shape is Convex?Equivalence of minimum cost circulation problem and minimum cost max flow problemGiven max-flow determine if edge is in a min-cutWhat is the intuition behind the way of reading off a dual optimal solution from simplex primal tabular in CLRS?










1












$begingroup$


I am learning algorithms to solve Maximum Flow problem by reading the CRLS book and confused by the following figure:



figure 26.4



That is:




A flow in a residual network provides a roadmap for adding flow to the
original flow network. If $f$ is a flow in $G$ and $f'$ is a flow in
the corresponding residual network $G_f$, we define $f uparrow f'$,
the augmentation of flow $f$ by $f'$, to be a function from $V times V$ to
$R$, defined by



$$(f uparrow f')(u, v) = begincases f(u,v) + f'(u, v) - f'(v, u) &
> textif (u,v) $in$ E \ 0 & textotherwise endcases$$




How the flow network in (c), for example $(s, v_2)$ got the flow 12 ?
If we follow the formula, it must have a flow 5:
$8 + 5 - 8 = 5$










share|cite|improve this question









$endgroup$
















    1












    $begingroup$


    I am learning algorithms to solve Maximum Flow problem by reading the CRLS book and confused by the following figure:



    figure 26.4



    That is:




    A flow in a residual network provides a roadmap for adding flow to the
    original flow network. If $f$ is a flow in $G$ and $f'$ is a flow in
    the corresponding residual network $G_f$, we define $f uparrow f'$,
    the augmentation of flow $f$ by $f'$, to be a function from $V times V$ to
    $R$, defined by



    $$(f uparrow f')(u, v) = begincases f(u,v) + f'(u, v) - f'(v, u) &
    > textif (u,v) $in$ E \ 0 & textotherwise endcases$$




    How the flow network in (c), for example $(s, v_2)$ got the flow 12 ?
    If we follow the formula, it must have a flow 5:
    $8 + 5 - 8 = 5$










    share|cite|improve this question









    $endgroup$














      1












      1








      1





      $begingroup$


      I am learning algorithms to solve Maximum Flow problem by reading the CRLS book and confused by the following figure:



      figure 26.4



      That is:




      A flow in a residual network provides a roadmap for adding flow to the
      original flow network. If $f$ is a flow in $G$ and $f'$ is a flow in
      the corresponding residual network $G_f$, we define $f uparrow f'$,
      the augmentation of flow $f$ by $f'$, to be a function from $V times V$ to
      $R$, defined by



      $$(f uparrow f')(u, v) = begincases f(u,v) + f'(u, v) - f'(v, u) &
      > textif (u,v) $in$ E \ 0 & textotherwise endcases$$




      How the flow network in (c), for example $(s, v_2)$ got the flow 12 ?
      If we follow the formula, it must have a flow 5:
      $8 + 5 - 8 = 5$










      share|cite|improve this question









      $endgroup$




      I am learning algorithms to solve Maximum Flow problem by reading the CRLS book and confused by the following figure:



      figure 26.4



      That is:




      A flow in a residual network provides a roadmap for adding flow to the
      original flow network. If $f$ is a flow in $G$ and $f'$ is a flow in
      the corresponding residual network $G_f$, we define $f uparrow f'$,
      the augmentation of flow $f$ by $f'$, to be a function from $V times V$ to
      $R$, defined by



      $$(f uparrow f')(u, v) = begincases f(u,v) + f'(u, v) - f'(v, u) &
      > textif (u,v) $in$ E \ 0 & textotherwise endcases$$




      How the flow network in (c), for example $(s, v_2)$ got the flow 12 ?
      If we follow the formula, it must have a flow 5:
      $8 + 5 - 8 = 5$







      algorithms network-flow






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Apr 7 at 15:52









      maksadbekmaksadbek

      1185




      1185




















          2 Answers
          2






          active

          oldest

          votes


















          4












          $begingroup$

          That's not what the formula gives you. As the caption says, the capacity of the augmenting path in the residual network in (b) is $4$. Therefore we send 4 units of flow along the augmenting path from $s$ to $t$, namely, the path $s to v_2 to v_3 to t$. In particular, $f(s,v_2)=8$, $f'(s,v_2)=4$, and $f'(v_2,s)=0$, so the updated flow is $8+4-0=12$.






          share|cite|improve this answer









          $endgroup$




















            3












            $begingroup$

            It is explained in part (b) of the caption of Figure 26.4.




            The residual network $G_f$ with augmenting path $p$ shaded; its residual capacity is $c_f(p)=c_f(v_2,v_3)=4$.




            Since the capacity of path $p$ is 4 (not 5), we find a flow $f'$ in the residual network $G_f$ that is defined by $f'(s,v_2)=f'(v_2,v_3)=f'(v_3,t)=4$. So for the network flow $fuparrow f'$ in (c), we have
            $$ (fuparrow f')(v_2, v_3)=f(v_2,v_3)+f'(v_2,v_3) = 8+4=12.$$






            share|cite|improve this answer











            $endgroup$













              Your Answer





              StackExchange.ifUsing("editor", function ()
              return StackExchange.using("mathjaxEditing", function ()
              StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
              StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
              );
              );
              , "mathjax-editing");

              StackExchange.ready(function()
              var channelOptions =
              tags: "".split(" "),
              id: "419"
              ;
              initTagRenderer("".split(" "), "".split(" "), channelOptions);

              StackExchange.using("externalEditor", function()
              // Have to fire editor after snippets, if snippets enabled
              if (StackExchange.settings.snippets.snippetsEnabled)
              StackExchange.using("snippets", function()
              createEditor();
              );

              else
              createEditor();

              );

              function createEditor()
              StackExchange.prepareEditor(
              heartbeatType: 'answer',
              autoActivateHeartbeat: false,
              convertImagesToLinks: false,
              noModals: true,
              showLowRepImageUploadWarning: true,
              reputationToPostImages: null,
              bindNavPrevention: true,
              postfix: "",
              imageUploader:
              brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
              contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
              allowUrls: true
              ,
              onDemand: true,
              discardSelector: ".discard-answer"
              ,immediatelyShowMarkdownHelp:true
              );



              );













              draft saved

              draft discarded


















              StackExchange.ready(
              function ()
              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106608%2fwhy-clrs-example-on-residual-networks-does-not-follows-its-formula%23new-answer', 'question_page');

              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              4












              $begingroup$

              That's not what the formula gives you. As the caption says, the capacity of the augmenting path in the residual network in (b) is $4$. Therefore we send 4 units of flow along the augmenting path from $s$ to $t$, namely, the path $s to v_2 to v_3 to t$. In particular, $f(s,v_2)=8$, $f'(s,v_2)=4$, and $f'(v_2,s)=0$, so the updated flow is $8+4-0=12$.






              share|cite|improve this answer









              $endgroup$

















                4












                $begingroup$

                That's not what the formula gives you. As the caption says, the capacity of the augmenting path in the residual network in (b) is $4$. Therefore we send 4 units of flow along the augmenting path from $s$ to $t$, namely, the path $s to v_2 to v_3 to t$. In particular, $f(s,v_2)=8$, $f'(s,v_2)=4$, and $f'(v_2,s)=0$, so the updated flow is $8+4-0=12$.






                share|cite|improve this answer









                $endgroup$















                  4












                  4








                  4





                  $begingroup$

                  That's not what the formula gives you. As the caption says, the capacity of the augmenting path in the residual network in (b) is $4$. Therefore we send 4 units of flow along the augmenting path from $s$ to $t$, namely, the path $s to v_2 to v_3 to t$. In particular, $f(s,v_2)=8$, $f'(s,v_2)=4$, and $f'(v_2,s)=0$, so the updated flow is $8+4-0=12$.






                  share|cite|improve this answer









                  $endgroup$



                  That's not what the formula gives you. As the caption says, the capacity of the augmenting path in the residual network in (b) is $4$. Therefore we send 4 units of flow along the augmenting path from $s$ to $t$, namely, the path $s to v_2 to v_3 to t$. In particular, $f(s,v_2)=8$, $f'(s,v_2)=4$, and $f'(v_2,s)=0$, so the updated flow is $8+4-0=12$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Apr 7 at 17:50









                  D.W.D.W.

                  103k12129294




                  103k12129294





















                      3












                      $begingroup$

                      It is explained in part (b) of the caption of Figure 26.4.




                      The residual network $G_f$ with augmenting path $p$ shaded; its residual capacity is $c_f(p)=c_f(v_2,v_3)=4$.




                      Since the capacity of path $p$ is 4 (not 5), we find a flow $f'$ in the residual network $G_f$ that is defined by $f'(s,v_2)=f'(v_2,v_3)=f'(v_3,t)=4$. So for the network flow $fuparrow f'$ in (c), we have
                      $$ (fuparrow f')(v_2, v_3)=f(v_2,v_3)+f'(v_2,v_3) = 8+4=12.$$






                      share|cite|improve this answer











                      $endgroup$

















                        3












                        $begingroup$

                        It is explained in part (b) of the caption of Figure 26.4.




                        The residual network $G_f$ with augmenting path $p$ shaded; its residual capacity is $c_f(p)=c_f(v_2,v_3)=4$.




                        Since the capacity of path $p$ is 4 (not 5), we find a flow $f'$ in the residual network $G_f$ that is defined by $f'(s,v_2)=f'(v_2,v_3)=f'(v_3,t)=4$. So for the network flow $fuparrow f'$ in (c), we have
                        $$ (fuparrow f')(v_2, v_3)=f(v_2,v_3)+f'(v_2,v_3) = 8+4=12.$$






                        share|cite|improve this answer











                        $endgroup$















                          3












                          3








                          3





                          $begingroup$

                          It is explained in part (b) of the caption of Figure 26.4.




                          The residual network $G_f$ with augmenting path $p$ shaded; its residual capacity is $c_f(p)=c_f(v_2,v_3)=4$.




                          Since the capacity of path $p$ is 4 (not 5), we find a flow $f'$ in the residual network $G_f$ that is defined by $f'(s,v_2)=f'(v_2,v_3)=f'(v_3,t)=4$. So for the network flow $fuparrow f'$ in (c), we have
                          $$ (fuparrow f')(v_2, v_3)=f(v_2,v_3)+f'(v_2,v_3) = 8+4=12.$$






                          share|cite|improve this answer











                          $endgroup$



                          It is explained in part (b) of the caption of Figure 26.4.




                          The residual network $G_f$ with augmenting path $p$ shaded; its residual capacity is $c_f(p)=c_f(v_2,v_3)=4$.




                          Since the capacity of path $p$ is 4 (not 5), we find a flow $f'$ in the residual network $G_f$ that is defined by $f'(s,v_2)=f'(v_2,v_3)=f'(v_3,t)=4$. So for the network flow $fuparrow f'$ in (c), we have
                          $$ (fuparrow f')(v_2, v_3)=f(v_2,v_3)+f'(v_2,v_3) = 8+4=12.$$







                          share|cite|improve this answer














                          share|cite|improve this answer



                          share|cite|improve this answer








                          edited Apr 7 at 17:52

























                          answered Apr 7 at 17:51









                          Apass.JackApass.Jack

                          14.1k1940




                          14.1k1940



























                              draft saved

                              draft discarded
















































                              Thanks for contributing an answer to Computer Science Stack Exchange!


                              • Please be sure to answer the question. Provide details and share your research!

                              But avoid


                              • Asking for help, clarification, or responding to other answers.

                              • Making statements based on opinion; back them up with references or personal experience.

                              Use MathJax to format equations. MathJax reference.


                              To learn more, see our tips on writing great answers.




                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function ()
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcs.stackexchange.com%2fquestions%2f106608%2fwhy-clrs-example-on-residual-networks-does-not-follows-its-formula%23new-answer', 'question_page');

                              );

                              Post as a guest















                              Required, but never shown





















































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown

































                              Required, but never shown














                              Required, but never shown












                              Required, but never shown







                              Required, but never shown







                              Popular posts from this blog

                              Sum ergo cogito? 1 nng

                              419 nièngy_Soadمي 19bal1.5o_g

                              Queiggey Chernihivv 9NnOo i Zw X QqKk LpB