equal
deleted
inserted
replaced
1494 /// |
1494 /// |
1495 ///\code |
1495 ///\code |
1496 /// ListGraph g; |
1496 /// ListGraph g; |
1497 ///\endcode |
1497 ///\endcode |
1498 /// |
1498 /// |
1499 ///Then RevGraphAdaptor implements the graph structure with node-set |
1499 ///Then ResGraphAdaptor implements the graph structure with node-set |
1500 /// \f$ V \f$ and edge-set \f$ A_{forward}\cup A_{backward} \f$, |
1500 /// \f$ V \f$ and edge-set \f$ A_{forward}\cup A_{backward} \f$, |
1501 ///where \f$ A_{forward}=\{uv : uv\in A, f(uv)<c(uv)\} \f$ and |
1501 ///where \f$ A_{forward}=\{uv : uv\in A, f(uv)<c(uv)\} \f$ and |
1502 /// \f$ A_{backward}=\{vu : uv\in A, f(uv)>0\} \f$, i.e. the so called |
1502 /// \f$ A_{backward}=\{vu : uv\in A, f(uv)>0\} \f$, i.e. the so called |
1503 ///residual graph. When we take the union |
1503 ///residual graph. When we take the union |
1504 /// \f$ A_{forward}\cup A_{backward} \f$, multilicities are counted, i.e. |
1504 /// \f$ A_{forward}\cup A_{backward} \f$, multilicities are counted, i.e. |