892 lines
189 KiB
HTML
892 lines
189 KiB
HTML
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<title>OR-Tools</title>
|
|
<meta http-equiv="Content-Type" content="text/html;"/>
|
|
<meta charset="utf-8"/>
|
|
<!--<link rel='stylesheet' type='text/css' href="https://fonts.googleapis.com/css?family=Ubuntu:400,700,400italic"/>-->
|
|
<link rel="stylesheet" type="text/css" href="ortools.css" title="default" media="screen,print" />
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 7.3</span>
|
|
</div>
|
|
</div>
|
|
<div id="content" style="width: 100%; overflow: hidden;">
|
|
<div style="margin-left: 15px; margin-top: 5px; float: left; color: #145A32;">
|
|
<h2>C++ Reference</h2>
|
|
<ul>
|
|
<li><a href="../cpp_algorithms/annotated.html">Algorithms</a></li>
|
|
<li><a href="../cpp_sat/annotated.html">CP-SAT</a></li>
|
|
<li><a href="../cpp_graph/annotated.html">Graph</a></li>
|
|
<li><a href="../cpp_routing/annotated.html">Routing</a></li>
|
|
<li><a href="../cpp_linear/annotated.html">Linear solver</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="content">
|
|
<div align="center">
|
|
<h1 style="color: #145A32;">C++ Reference: Graph</h1>
|
|
</div>
|
|
<!-- Generated by Doxygen 1.8.16 -->
|
|
<div id="navrow1" class="tabs">
|
|
<ul class="tablist">
|
|
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
|
|
<li><a href="annotated.html"><span>Classes</span></a></li>
|
|
<li class="current"><a href="files.html"><span>Files</span></a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="nav-path" class="navpath">
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_725f3a5915051842f84e3ea508be2a62.html">graph</a></li> </ul>
|
|
</div>
|
|
</div><!-- top -->
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">max_flow.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="max__flow_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// An implementation of a push-relabel algorithm for the max flow problem.</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// In the following, we consider a graph G = (V,E,s,t) where V denotes the set</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// of nodes (vertices) in the graph, E denotes the set of arcs (edges). s and t</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// denote distinguished nodes in G called source and target. n = |V| denotes the</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// number of nodes in the graph, and m = |E| denotes the number of arcs in the</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// graph.</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// Each arc (v,w) is associated a capacity c(v,w).</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// A flow is a function from E to R such that:</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// a) f(v,w) <= c(v,w) for all (v,w) in E (capacity constraint.)</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// b) f(v,w) = -f(w,v) for all (v,w) in E (flow antisymmetry constraint.)</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// c) sum on v f(v,w) = 0 (flow conservation.)</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">// The goal of this algorithm is to find the maximum flow from s to t, i.e.</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// for example to maximize sum v f(s,v).</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// The starting reference for this class of algorithms is:</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem.</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// ACM Symposium on Theory of Computing, pp. 136-146.</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// http://portal.acm.org/citation.cfm?id=12144.</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment">// The basic idea of the algorithm is to handle preflows instead of flows,</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment">// and to refine preflows until a maximum flow is obtained.</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment">// A preflow is like a flow, except that the inflow can be larger than the</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// outflow. If it is the case at a given node v, it is said that there is an</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// excess at node v, and inflow = outflow + excess.</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// More formally, a preflow is a function f such that:</span></div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// 1) f(v,w) <= c(v,w) for all (v,w) in E (capacity constraint). c(v,w) is a</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment">// value representing the maximum capacity for arc (v,w).</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">// 2) f(v,w) = -f(w,v) for all (v,w) in E (flow antisymmetry constraint)</span></div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// 3) excess(v) = sum on u f(u,v) >= 0 is the excess at node v, the</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// algebraic sum of all the incoming preflows at this node.</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// Each node has an associated "height", in addition to its excess. The</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// height of the source is defined to be equal to n, and cannot change. The</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// height of the target is defined to be zero, and cannot change either. The</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// height of all the other nodes is initialized at zero and is updated during</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// the algorithm (see below). For those who want to know the details, the height</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">// of a node, corresponds to a reduced cost, and this enables one to prove that</span></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// the algorithm actually computes the max flow. Note that the height of a node</span></div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// can be initialized to the distance to the target node in terms of number of</span></div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="comment">// nodes. This has not been tried in this implementation.</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// A node v is said to be *active* if excess(v) > 0.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// In this case the following operations can be applied to it:</span></div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// - if there are *admissible* incident arcs, i.e. arcs which are not saturated,</span></div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment">// and whose head's height is lower than the height of the active node</span></div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// considered, a PushFlow operation can be applied. It consists in sending as</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// much flow as both the excess at the node and the capacity of the arc</span></div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment">// permit.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment">// - if there are no admissible arcs, the active node considered is relabeled,</span></div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment">// i.e. its height is increased to 1 + the minimum height of its neighboring</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// nodes on admissible arcs.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment">// This is implemented in Discharge, which itself calls PushFlow and Relabel.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// Before running Discharge, it is necessary to initialize the algorithm with a</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment">// preflow. This is done in InitializePreflow, which saturates all the arcs</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// leaving the source node, and sets the excess at the heads of those arcs</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// accordingly.</span></div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// The algorithm terminates when there are no remaining active nodes, i.e. all</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// the excesses at all nodes are equal to zero. In this case, a maximum flow is</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment">// obtained.</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// The complexity of this algorithm depends amongst other things on the choice</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// of the next active node. It has been shown, for example in:</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// L. Tuncel, "On the Complexity of Preflow-Push Algorithms for Maximum-Flow</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment">// Problems", Algorithmica 11(4): 353-359 (1994).</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment">// and</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment">// J. Cheriyan and K. Mehlhorn, "An analysis of the highest-level selection rule</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment">// in the preflow-push max-flow algorithm", Information processing letters,</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// 69(5):239-242 (1999).</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// http://www.math.uwaterloo.ca/~jcheriya/PS_files/me3.0.ps</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment">// ...that choosing the active node with the highest level yields a</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment">// complexity of O(n^2 * sqrt(m)).</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// TODO(user): implement the above active node choice rule.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// This has been validated experimentally in:</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// R.K. Ahuja, M. Kodialam, A.K. Mishra, and J.B. Orlin, "Computational</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Investigations of Maximum Flow Algorithms", EJOR 97:509-542(1997).</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment">// http://jorlin.scripts.mit.edu/docs/publications/58-comput%20investigations%20of.pdf.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// TODO(user): an alternative would be to evaluate:</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// A.V. Goldberg, "The Partial Augment-Relabel Algorithm for the Maximum Flow</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// Problem.” In Proceedings of Algorithms ESA, LNCS 5193:466-477, Springer 2008.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment">// http://www.springerlink.com/index/5535k2j1mt646338.pdf</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// An interesting general reference on network flows is:</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// R. K. Ahuja, T. L. Magnanti, J. B. Orlin, "Network Flows: Theory, Algorithms,</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// and Applications," Prentice Hall, 1993, ISBN: 978-0136175490,</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// http://www.amazon.com/dp/013617549X</span></div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// Keywords: Push-relabel, max-flow, network, graph, Goldberg, Tarjan, Dinic,</span></div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Dinitz.</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="preprocessor">#ifndef OR_TOOLS_GRAPH_MAX_FLOW_H_</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#define OR_TOOLS_GRAPH_MAX_FLOW_H_</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  </div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="preprocessor">#include "ortools/base/integral_types.h"</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="preprocessor">#include "ortools/base/logging.h"</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="preprocessor">#include "ortools/base/macros.h"</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor">#include "<a class="code" href="ebert__graph_8h.html">ortools/graph/ebert_graph.h</a>"</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="preprocessor">#include "ortools/graph/flow_problem.pb.h"</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor">#include "<a class="code" href="graph_8h.html">ortools/graph/graph.h</a>"</span></div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="preprocessor">#include "ortools/util/stats.h"</span></div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="preprocessor">#include "ortools/util/zvector.h"</span></div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  </div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// Forward declaration.</span></div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html"> 144</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1GenericMaxFlow.html">GenericMaxFlow</a>;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// A simple and efficient max-cost flow interface. This is as fast as</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// GenericMaxFlow<ReverseArcStaticGraph>, which is the fastest, but uses</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// more memory in order to hide the somewhat involved construction of the</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// static graph.</span></div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment">// TODO(user): If the need arises, extend this interface to support warm start.</span></div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html"> 152</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1SimpleMaxFlow.html">SimpleMaxFlow</a> {</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// The constructor takes no size.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// New node indices will be created lazily by AddArcWithCapacity().</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a0b218e6bdef5560b441d7dc1b47d897f">SimpleMaxFlow</a>();</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  </div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// Adds a directed arc with the given capacity from tail to head.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// * Node indices and capacity must be non-negative (>= 0).</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// * Self-looping and duplicate arcs are supported.</span></div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// * After the method finishes, NumArcs() == the returned ArcIndex + 1.</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a9d8699dbc3e3b9cadc36d4fd5ee29dce">AddArcWithCapacity</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> tail, <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> head,</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> capacity);</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Returns the current number of nodes. This is one more than the largest</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// node index seen so far in AddArcWithCapacity().</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">NumNodes</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Returns the current number of arcs in the graph.</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a7898be8b7efbfe53a58fcf621cf41315">NumArcs</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Returns user-provided data.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// The implementation will crash if "arc" is not in [0, NumArcs()).</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46">Tail</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca">Head</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a9dcd8610149406a1593d2a0725290482">Capacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// Solves the problem (finds the maximum flow from the given source to the</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// given sink), and returns the problem status.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b"> 180</a></span>  <span class="keyword">enum</span> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// Solve() was called and found an optimal solution. Note that OptimalFlow()</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// may be 0 which means that the sink is not reachable from the source.</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"> 183</a></span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>,</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="comment">// There is a flow > std::numeric_limits<FlowQuantity>::max(). Note that in</span></div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="comment">// this case, the class will contain a solution with a flow reaching that</span></div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// bound.</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// TODO(user): rename POSSIBLE_OVERFLOW to INT_OVERFLOW and modify our</span></div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// clients.</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2"> 190</a></span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">POSSIBLE_OVERFLOW</a>,</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// The input is inconsistent (bad tail/head/capacity values).</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f"> 192</a></span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">BAD_INPUT</a>,</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">// This should not happen. There was an error in our code (i.e. file a bug).</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"><a class="line" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"> 194</a></span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  };</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a208812d23c7f00cbc76419a41038e7f1">Solve</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> source, <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> sink);</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  </div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// Returns the maximum flow we can send from the source to the sink in the</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// last OPTIMAL Solve() context.</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a865dfd15177ea8b4cd75a34ab9cee1b1">OptimalFlow</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  </div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Returns the flow on the given arc in the last OPTIMAL Solve() context.</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Note: It is possible that there is more than one optimal solution. The</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// algorithm is deterministic so it will always return the same solution for</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// a given problem. However, there is no guarantee of this from one code</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// version to the next (but the code does not change often).</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a2a420ad8221c326064736ccf148d2f93">Flow</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  </div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="comment">// Returns the nodes reachable from the source by non-saturated arcs (.i.e.</span></div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// arc with Flow(arc) < Capacity(arc)), the outgoing arcs of this set form a</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// minimum cut. This works only if Solve() returned OPTIMAL.</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a4ede8a987bfe0972a51942bbca22d4c1">GetSourceSideMinCut</a>(std::vector<NodeIndex>* result);</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  </div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="comment">// Returns the nodes that can reach the sink by non-saturated arcs, the</span></div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// outgoing arcs of this set form a minimum cut. Note that if this is the</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// complement set of GetNodeReachableFromSource(), then the min-cut is unique.</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// This works only if Solve() returned OPTIMAL.</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#ad8ca9f0f372e03f5cf3af1e163230792">GetSinkSideMinCut</a>(std::vector<NodeIndex>* result);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  </div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">// Creates the protocol buffer representation of the problem used by the last</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// Solve() call. This is mainly useful for debugging.</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  FlowModel <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#a4d39b4f2db0792ccce2a922c74f43ecf">CreateFlowModelOfLastSolve</a>();</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">// Change the capacity of an arc.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// WARNING: This looks like it enables incremental solves, but as of 2018-02,</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// the next Solve() will restart from scratch anyway.</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// TODO(user): Support incrementality in the max flow implementation.</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1SimpleMaxFlow.html#ac7bfd46bed70e12f118aa53df0c26769">SetArcCapacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> capacity);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  </div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> num_nodes_;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  std::vector<NodeIndex> arc_tail_;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  std::vector<NodeIndex> arc_head_;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  std::vector<FlowQuantity> arc_capacity_;</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  std::vector<ArcIndex> arc_permutation_;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  std::vector<FlowQuantity> arc_flow_;</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> optimal_flow_;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  </div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// Note that we cannot free the graph before we stop using the max-flow</span></div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="comment">// instance that uses it.</span></div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  typedef ::util::ReverseArcStaticGraph<NodeIndex, ArcIndex> Graph;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  std::unique_ptr<Graph> underlying_graph_;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  std::unique_ptr<GenericMaxFlow<Graph> > underlying_max_flow_;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1SimpleMaxFlow.html">SimpleMaxFlow</a>);</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span> };</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  </div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment">// Specific but efficient priority queue implementation. The priority type must</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// be an integer. The queue allows to retrieve the element with highest priority</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// but only allows pushes with a priority greater or equal to the highest</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment">// priority in the queue minus one. All operations are in O(1) and the memory is</span></div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment">// in O(num elements in the queue). Elements with the same priority are</span></div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment">// retrieved with LIFO order.</span></div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// Note(user): As far as I know, this is an original idea and is the only code</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// that use this in the Maximum Flow context. Papers usually refer to an</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// height-indexed array of simple linked lists of active node with the same</span></div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// height. Even worse, sometimes they use double-linked list to allow arbitrary</span></div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// height update in order to detect missing height (used for the Gap heuristic).</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// But this can actually be implemented a lot more efficiently by just</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// maintaining the height distribution of all the node in the graph.</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html"> 264</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html">PriorityQueueWithRestrictedPush</a> {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a3b2c821405c1875d5f8975e1ceae6a60"> 266</a></span>  <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a3b2c821405c1875d5f8975e1ceae6a60">PriorityQueueWithRestrictedPush</a>() : even_queue_(), odd_queue_() {}</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// Is the queue empty?</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  </div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// Clears the queue.</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  </div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="comment">// Push a new element in the queue. Its priority must be greater or equal to</span></div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// the highest priority present in the queue, minus one. This condition is</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// DCHECKed, and violating it yields erroneous queue behavior in NDEBUG mode.</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a83681186fdc5615ec1185ad4075e1023">Push</a>(Element element, IntegerPriority priority);</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// Returns the element with highest priority and remove it from the queue.</span></div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// IsEmpty() must be false, this condition is DCHECKed.</span></div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  Element <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#af355586ee86be2298efe2e81367eeffe">Pop</a>();</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// Helper function to get the last element of a vector and pop it.</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  Element PopBack(std::vector<std::pair<Element, IntegerPriority> >* queue);</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// This is the heart of the algorithm. basically we split the elements by</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// parity of their priority and the precondition on the Push() ensures that</span></div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// both vectors are always sorted by increasing priority.</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  std::vector<std::pair<Element, IntegerPriority> > even_queue_;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  std::vector<std::pair<Element, IntegerPriority> > odd_queue_;</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html">PriorityQueueWithRestrictedPush</a>);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> };</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  </div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// We want an enum for the Status of a max flow run, and we want this</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// enum to be scoped under GenericMaxFlow<>. Unfortunately, swig</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span> <span class="comment">// doesn't handle templated enums very well, so we need a base,</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment">// untemplated class to hold it.</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html"> 300</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html">MaxFlowStatusClass</a> {</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70b"> 302</a></span>  <span class="keyword">enum</span> <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> {</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f"> 303</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">NOT_SOLVED</a>, <span class="comment">// The problem was not solved, or its data were edited.</span></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"> 304</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">OPTIMAL</a>, <span class="comment">// Solve() was called and found an optimal solution.</span></div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef3d63bf3419a0e33cd86b58fadc640b"> 305</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef3d63bf3419a0e33cd86b58fadc640b">INT_OVERFLOW</a>, <span class="comment">// There is a feasible flow > max possible flow.</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f"> 306</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">BAD_INPUT</a>, <span class="comment">// The input is inconsistent.</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"> 307</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">BAD_RESULT</a> <span class="comment">// There was an error.</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  };</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> };</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment">// Generic MaxFlow (there is a default MaxFlow specialization defined below)</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment">// that works with StarGraph and all the reverse arc graphs from graph.h, see</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment">// the end of max_flow.cc for the exact types this class is compiled for.</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Graph></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="keyword">class </span>GenericMaxFlow : <span class="keyword">public</span> MaxFlowStatusClass {</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf"> 317</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">Graph::NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a>;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48"> 318</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">Graph::ArcIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a>;</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a0d012d3907b8306ddfc1a7089342fbe2"> 319</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> Graph::OutgoingArcIterator <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a0d012d3907b8306ddfc1a7089342fbe2">OutgoingArcIterator</a>;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> Graph::OutgoingOrOppositeIncomingArcIterator</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a277838ded7171a604a67babdbea05988"> 321</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a277838ded7171a604a67babdbea05988">OutgoingOrOppositeIncomingArcIterator</a>;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ab9d95dc874e5c2d424cecd251fd7ff82"> 322</a></span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> Graph::IncomingArcIterator <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab9d95dc874e5c2d424cecd251fd7ff82">IncomingArcIterator</a>;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ad2ab85b2912dbf12804d3d1ddea9ec15"> 323</a></span>  <span class="keyword">typedef</span> ZVector<ArcIndex> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad2ab85b2912dbf12804d3d1ddea9ec15">ArcIndexArray</a>;</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  </div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// The height of a node never excess 2 times the number of node, so we</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// use the same type as a Node index.</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a798f41062d76af3baabada0c4c0580ea"> 327</a></span>  <span class="keyword">typedef</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a798f41062d76af3baabada0c4c0580ea">NodeHeight</a>;</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a852dcceddb3bc2642eb867cc3663c0fe"> 328</a></span>  <span class="keyword">typedef</span> ZVector<NodeHeight> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a852dcceddb3bc2642eb867cc3663c0fe">NodeHeightArray</a>;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  </div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Initialize a MaxFlow instance on the given graph. The graph does not need</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// to be fully built yet, but its capacity reservation are used to initialize</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// the memory of this class. source and sink must also be valid node of</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// graph.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#acef9fcefb0d5124677a8a9b460c30410">GenericMaxFlow</a>(<span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>* <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>, <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> source, <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> sink);</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#abab657a2626df3ab99dfd21d811ff43c"> 335</a></span>  <span class="keyword">virtual</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#abab657a2626df3ab99dfd21d811ff43c">~GenericMaxFlow</a>() {}</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  </div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">// Returns the graph associated to the current object.</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc"> 338</a></span>  <span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>* <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>; }</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  </div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Returns the status of last call to Solve(). NOT_SOLVED is returned if</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// Solve() has never been called or if the problem has been modified in such a</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// way that the previous solution becomes invalid.</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#adb1490a44086db009cdb51f854a02a65"> 343</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#adb1490a44086db009cdb51f854a02a65">status</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#abf8c6fcb7d9c9fa39e283d086f0bb345">status_</a>; }</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  </div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// Returns the index of the node corresponding to the source of the network.</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a29b76a85638e0b4ce0f715c5bbba3f81"> 346</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a29b76a85638e0b4ce0f715c5bbba3f81">GetSourceNodeIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aab4ab1dc9be85072322b17c1f56fe208">source_</a>; }</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  </div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// Returns the index of the node corresponding to the sink of the network.</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#af412987a2f98057ca8c6015782418eac"> 349</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af412987a2f98057ca8c6015782418eac">GetSinkNodeIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671">sink_</a>; }</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// Sets the capacity for arc to new_capacity.</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a21776d0248204801a49c42b46902c1a1">SetArcCapacity</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> new_capacity);</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  </div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Sets the flow for arc.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a38f480b60f3812345680d2267770ee5c">SetArcFlow</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> new_flow);</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// Returns true if a maximum flow was solved.</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a942f29030f08426e7e318204e987e2f7">Solve</a>();</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// Returns the total flow found by the algorithm.</span></div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a142146c1af2855fc821d7bd4c0af6130"> 361</a></span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a142146c1af2855fc821d7bd4c0af6130">GetOptimalFlow</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af63274e5211be9578b29f56f29936964">node_excess_</a>[<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671">sink_</a>]; }</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  </div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="comment">// Returns the flow on arc using the equations given in the comment on</span></div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="comment">// residual_arc_capacity_.</span></div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a2a420ad8221c326064736ccf148d2f93"> 365</a></span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a2a420ad8221c326064736ccf148d2f93">Flow</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af3a76f97fe869af7137bbc9a165353b1">IsArcDirect</a>(arc)) {</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>[<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#adf24020c0638fbd28d483762e6247ff5">Opposite</a>(arc)];</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> -<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>[arc];</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  </div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// Returns the capacity of arc using the equations given in the comment on</span></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">// residual_arc_capacity_.</span></div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a9dcd8610149406a1593d2a0725290482"> 375</a></span>  <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a9dcd8610149406a1593d2a0725290482">Capacity</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af3a76f97fe869af7137bbc9a165353b1">IsArcDirect</a>(arc)) {</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>[arc] +</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>[<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#adf24020c0638fbd28d483762e6247ff5">Opposite</a>(arc)];</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  }</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  </div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// Returns the nodes reachable from the source in the residual graph, the</span></div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// outgoing arcs of this set form a minimum cut.</span></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ede8a987bfe0972a51942bbca22d4c1">GetSourceSideMinCut</a>(std::vector<NodeIndex>* result);</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  </div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="comment">// Returns the nodes that can reach the sink in the residual graph, the</span></div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// outgoing arcs of this set form a minimum cut. Note that if this is the</span></div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="comment">// complement of GetNodeReachableFromSource(), then the min-cut is unique.</span></div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="comment">// TODO(user): In the two-phases algorithm, we can get this minimum cut</span></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  <span class="comment">// without doing the second phase. Add an option for this if there is a need</span></div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="comment">// to, note that the second phase is pretty fast so the gain will be small.</span></div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad8ca9f0f372e03f5cf3af1e163230792">GetSinkSideMinCut</a>(std::vector<NodeIndex>* result);</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  </div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="comment">// Checks the consistency of the input, i.e. that capacities on the arcs are</span></div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="comment">// non-negative or null.</span></div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a12ffc143b8d66de80c07572cc8509037">CheckInputConsistency</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  </div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// Checks whether the result is valid, i.e. that node excesses are all equal</span></div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="comment">// to zero (we have a flow) and that residual capacities are all non-negative</span></div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// or zero.</span></div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aac87a51b41d88b6976a12007bae9b91d">CheckResult</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="comment">// Returns true if there exists a path from the source to the sink with</span></div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="comment">// remaining capacity. This allows us to easily check at the end that the flow</span></div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// we computed is indeed optimal (provided that all the conditions tested by</span></div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// CheckResult() also hold).</span></div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda">AugmentingPathExists</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  </div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="comment">// Sets the different algorithm options. All default to true.</span></div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="comment">// See the corresponding variable declaration below for more details.</span></div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a6b27587e2eba1f139e5b5b2609315aaa"> 414</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a6b27587e2eba1f139e5b5b2609315aaa">SetUseGlobalUpdate</a>(<span class="keywordtype">bool</span> value) {</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402">use_global_update_</a> = value;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402">use_global_update_</a>) <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a> = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a4549e7f9a27adb25091a91101b8fddbd"> 418</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4549e7f9a27adb25091a91101b8fddbd">SetUseTwoPhaseAlgorithm</a>(<span class="keywordtype">bool</span> value) { <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a689c39e9d4a7bdb9d64e270b8c9abcbd">use_two_phase_algorithm_</a> = value; }</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#aa76638d2f8eddf2c3d9778b3c1285010"> 419</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aa76638d2f8eddf2c3d9778b3c1285010">SetCheckInput</a>(<span class="keywordtype">bool</span> value) { <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad96578b8ab41d25a3daa9f219c168b9f">check_input_</a> = value; }</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#aa4e5f2ba9abcf71460c68a4903abc7bc"> 420</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aa4e5f2ba9abcf71460c68a4903abc7bc">SetCheckResult</a>(<span class="keywordtype">bool</span> value) { <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a876e41aaef1635d059d9d79dd08bbfc3">check_result_</a> = value; }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ae93d8aa8c02df69fd88f9cdd1463bae3"> 421</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ae93d8aa8c02df69fd88f9cdd1463bae3">ProcessNodeByHeight</a>(<span class="keywordtype">bool</span> value) {</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a> = value && <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402">use_global_update_</a>;</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  </div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="comment">// Returns the protocol buffer representation of the current problem.</span></div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  FlowModel <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#afbd2be8210b3c04ac5ee3a879f1e62de">CreateFlowModel</a>();</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  </div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">protected</span>:</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <span class="comment">// Returns true if arc is admissible.</span></div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a189d42cc721a58aa0b397cc44da875b7"> 430</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a189d42cc721a58aa0b397cc44da875b7">IsAdmissible</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>[arc] > 0 &&</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>[<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46">Tail</a>(arc)] == <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>[<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca">Head</a>(arc)] + 1;</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  </div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">// Returns true if node is active, i.e. if its excess is positive and it</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// is neither the source or the sink of the graph.</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#af337463a7577a73e5140bfe6518852b1"> 437</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af337463a7577a73e5140bfe6518852b1">IsActive</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">return</span> (node != <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aab4ab1dc9be85072322b17c1f56fe208">source_</a>) && (node != <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671">sink_</a>) && (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af63274e5211be9578b29f56f29936964">node_excess_</a>[node] > 0);</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  </div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// Sets the capacity of arc to 'capacity' and clears the flow on arc.</span></div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a7ba7917e55551f771954c4323992a9ab"> 442</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a7ba7917e55551f771954c4323992a9ab">SetCapacityAndClearFlow</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc, <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> capacity) {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>.Set(arc, capacity);</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>.Set(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#adf24020c0638fbd28d483762e6247ff5">Opposite</a>(arc), 0);</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="comment">// Returns true if a precondition for Relabel is met, i.e. the outgoing arcs</span></div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="comment">// of node are all either saturated or the heights of their heads are greater</span></div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// or equal to the height of node.</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a2a555ba2dc0a468e6fee4a0665b12272">CheckRelabelPrecondition</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> node) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  </div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// Returns context concatenated with information about arc</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// in a human-friendly way.</span></div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  std::string <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a2212ce00ee245370c5cb71234244027a">DebugString</a>(<span class="keyword">const</span> std::string& context, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  </div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// Initializes the container active_nodes_.</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45">InitializeActiveNodeContainer</a>();</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// Get the first element from the active node container.</span></div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a89970809d6caccf0fc1ba38d7d955254"> 460</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a89970809d6caccf0fc1ba38d7d955254">GetAndRemoveFirstActiveNode</a>() {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a>) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f">active_node_by_height_</a>.<a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#af355586ee86be2298efe2e81367eeffe">Pop</a>();</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> node = <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>.back();</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>.pop_back();</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> node;</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  </div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// Push element to the active node container.</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a420abfd079f041eac775859ab19e644d"> 468</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a420abfd079f041eac775859ab19e644d">PushActiveNode</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a>& node) {</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a>) {</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f">active_node_by_height_</a>.<a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a83681186fdc5615ec1185ad4075e1023">Push</a>(node, <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>[node]);</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>.push_back(node);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  }</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="comment">// Check the emptiness of the container.</span></div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a8f70d2ab94c2c3a7f05c6f2a3bc18573"> 477</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a8f70d2ab94c2c3a7f05c6f2a3bc18573">IsEmptyActiveNodeContainer</a>() {</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a>) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f">active_node_by_height_</a>.<a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>();</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>.empty();</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  }</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// Performs optimization step.</span></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad45b094d532baccee95649c24192f87a">Refine</a>();</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad28be43d46715cda54108a189081d139">RefineWithGlobalUpdate</a>();</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  </div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// Discharges an active node node by saturating its admissible adjacent arcs,</span></div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// if any, and by relabelling it when it becomes inactive.</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af4b75883cbba15f442c627f5da96f470">Discharge</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> node);</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// Initializes the preflow to a state that enables to run Refine.</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0">InitializePreflow</a>();</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// Clears the flow excess at each node by pushing the flow back to the source:</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// - Do a depth-first search from the source in the direct graph to cancel</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">// flow cycles.</span></div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">// - Then, return flow excess along the depth-first search tree (by pushing</span></div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// the flow in the reverse dfs topological order).</span></div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// The theoretical complexity is O(mn), but it is a lot faster in practice.</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3a4afd902c22768de7955ba9983fb282">PushFlowExcessBackToSource</a>();</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  </div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="comment">// Computes the best possible node potential given the current flow using a</span></div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// reverse breadth-first search from the sink in the reverse residual graph.</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// This is an implementation of the global update heuristic mentioned in many</span></div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="comment">// max-flow papers. See for instance: B.V. Cherkassky, A.V. Goldberg, "On</span></div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// implementing push-relabel methods for the maximum flow problem",</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="comment">// Algorithmica, 19:390-410, 1997.</span></div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// ftp://reports.stanford.edu/pub/cstr/reports/cs/tr/94/1523/CS-TR-94-1523.pdf</span></div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a28b52dfd2da6e91a8e1e0d039c1d4154">GlobalUpdate</a>();</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  </div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// Tries to saturate all the outgoing arcs from the source that can reach the</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="comment">// sink. Most of the time, we can do that in one go, except when more flow</span></div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="comment">// than kMaxFlowQuantity can be pushed out of the source in which case we</span></div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="comment">// have to be careful. Returns true if some flow was pushed.</span></div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a24f768765349e100ca2ef7697d1b52d5">SaturateOutgoingArcsFromSource</a>();</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  </div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// Pushes flow on arc, i.e. consumes flow on residual_arc_capacity_[arc],</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// and consumes -flow on residual_arc_capacity_[Opposite(arc)]. Updates</span></div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">// node_excess_ at the tail and head of arc accordingly.</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#abedc5621560431c2527859bd5d1ab8fc">PushFlow</a>(<a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> flow, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  </div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// Relabels a node, i.e. increases its height by the minimum necessary amount.</span></div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// This version of Relabel is relaxed in a way such that if an admissible arc</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="comment">// exists at the current node height, then the node is not relabeled. This</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="comment">// enables us to deal with wrong values of first_admissible_arc_[node] when</span></div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// updating it is too costly.</span></div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a187f8b09657eacdfef77202c595543f6">Relabel</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> node);</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  </div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// Handy member functions to make the code more compact.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca"> 532</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca">Head</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>->Head(arc); }</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46"> 533</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46">Tail</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">ArcIndex</a> arc)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>->Tail(arc); }</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#adf24020c0638fbd28d483762e6247ff5">Opposite</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af3a76f97fe869af7137bbc9a165353b1">IsArcDirect</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ac17ea9ef2dc1b5eace76f625abe36475">IsArcValid</a>(<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  </div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// Returns the set of nodes reachable from start in the residual graph or in</span></div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="comment">// the reverse residual graph (if reverse is true).</span></div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="keyword">template</span> <<span class="keywordtype">bool</span> reverse></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ac0290c8f8892c50d7b29e9770fda4923">ComputeReachableNodes</a>(<a class="code" href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">NodeIndex</a> start, std::vector<NodeIndex>* result);</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  </div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// Maximum manageable flow.</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a2cb1ce0e6ac75b050ffc3a7bfd35a8b2"> 544</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">FlowQuantity</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a2cb1ce0e6ac75b050ffc3a7bfd35a8b2">kMaxFlowQuantity</a>;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  </div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// A pointer to the graph passed as argument.</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378"> 547</a></span>  <span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>* <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378">graph_</a>;</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// An array representing the excess for each node in graph_.</span></div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#af63274e5211be9578b29f56f29936964"> 550</a></span>  <a class="code" href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1">QuantityArray</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#af63274e5211be9578b29f56f29936964">node_excess_</a>;</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  </div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">// An array representing the height function for each node in graph_. For a</span></div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="comment">// given node, this is a lower bound on the shortest path length from this</span></div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="comment">// node to the sink in the residual network. The height of a node always goes</span></div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// up during the course of a Solve().</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// Since initially we saturate all the outgoing arcs of the source, we can</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// never reach the sink from the source in the residual graph. Initially we</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="comment">// set the height of the source to n (the number of node of the graph) and it</span></div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// never changes. If a node as an height >= n, then this node can't reach the</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// sink and its height minus n is a lower bound on the shortest path length</span></div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// from this node to the source in the residual graph.</span></div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483"> 563</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a852dcceddb3bc2642eb867cc3663c0fe">NodeHeightArray</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483">node_potential_</a>;</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  </div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// An array representing the residual_capacity for each arc in graph_.</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// Residual capacities enable one to represent the capacity and flow for all</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// arcs in the graph in the following manner.</span></div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">// For all arc, residual_arc_capacity_[arc] = capacity[arc] - flow[arc]</span></div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// Moreover, for reverse arcs, capacity[arc] = 0 by definition,</span></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">// Also flow[Opposite(arc)] = -flow[arc] by definition.</span></div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">// Therefore:</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// - for a direct arc:</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// flow[arc] = 0 - flow[Opposite(arc)]</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// = capacity[Opposite(arc)] - flow[Opposite(arc)]</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// = residual_arc_capacity_[Opposite(arc)]</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// - for a reverse arc:</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// flow[arc] = -residual_arc_capacity_[arc]</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Using these facts enables one to only maintain residual_arc_capacity_,</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// instead of both capacity and flow, for each direct and indirect arc. This</span></div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="comment">// reduces the amount of memory for this information by a factor 2.</span></div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286"> 581</a></span>  <a class="code" href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1">QuantityArray</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">residual_arc_capacity_</a>;</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  </div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// An array representing the first admissible arc for each node in graph_.</span></div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a3702055ec6affa60e6862cd0e63f9a7b"> 584</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad2ab85b2912dbf12804d3d1ddea9ec15">ArcIndexArray</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3702055ec6affa60e6862cd0e63f9a7b">first_admissible_arc_</a>;</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  </div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="comment">// A stack used for managing active nodes in the algorithm.</span></div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="comment">// Note that the papers cited above recommend the use of a queue, but</span></div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// benchmarking so far has not proved it is better. In particular, processing</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// nodes in LIFO order has better cache locality.</span></div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b"> 590</a></span>  std::vector<NodeIndex> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">active_nodes_</a>;</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  </div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// A priority queue used for managing active nodes in the algorithm. It allows</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// to select the active node with highest height before each Discharge().</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Moreover, since all pushes from this node will be to nodes with height</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// greater or equal to the initial discharged node height minus one, the</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// PriorityQueueWithRestrictedPush is a perfect fit.</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f"> 597</a></span>  <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html">PriorityQueueWithRestrictedPush<NodeIndex, NodeHeight></a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f">active_node_by_height_</a>;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// The index of the source node in graph_.</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#aab4ab1dc9be85072322b17c1f56fe208"> 600</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aab4ab1dc9be85072322b17c1f56fe208">source_</a>;</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  </div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="comment">// The index of the sink node in graph_.</span></div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671"> 603</a></span>  <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671">sink_</a>;</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  </div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="comment">// The status of the problem.</span></div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#abf8c6fcb7d9c9fa39e283d086f0bb345"> 606</a></span>  <a class="code" href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">Status</a> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#abf8c6fcb7d9c9fa39e283d086f0bb345">status_</a>;</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  </div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// BFS queue used by the GlobalUpdate() function. We do not use a C++ queue</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// because we need access to the vector for different optimizations.</span></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a8b98114a0a6beb83e5b36e4e461659fd"> 610</a></span>  std::vector<bool> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a8b98114a0a6beb83e5b36e4e461659fd">node_in_bfs_queue_</a>;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a2b834b1bfbaef46bbf4a3f991a26f9a3"> 611</a></span>  std::vector<NodeIndex> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a2b834b1bfbaef46bbf4a3f991a26f9a3">bfs_queue_</a>;</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  </div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// Whether or not to use GlobalUpdate().</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402"> 614</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402">use_global_update_</a>;</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  </div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// Whether or not we use a two-phase algorithm:</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// 1/ Only deal with nodes that can reach the sink. At the end we know the</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// value of the maximum flow and we have a min-cut.</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// 2/ Call PushFlowExcessBackToSource() to obtain a max-flow. This is usually</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// a lot faster than the first phase.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a689c39e9d4a7bdb9d64e270b8c9abcbd"> 621</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a689c39e9d4a7bdb9d64e270b8c9abcbd">use_two_phase_algorithm_</a>;</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  </div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// Whether or not we use the PriorityQueueWithRestrictedPush to process the</span></div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// active nodes rather than a simple queue. This can only be true if</span></div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="comment">// use_global_update_ is true.</span></div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// Note(user): using a template will be slightly faster, but since we test</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// this in a non-critical path, this only has a minor impact.</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51"> 629</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">process_node_by_height_</a>;</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  </div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// Whether or not we check the input, this is a small price to pay for</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// robustness. Disable only if you know the input is valid because an invalid</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// input can cause the algorithm to run into an infinite loop!</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#ad96578b8ab41d25a3daa9f219c168b9f"> 634</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#ad96578b8ab41d25a3daa9f219c168b9f">check_input_</a>;</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  </div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// Whether or not we check the result.</span></div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// TODO(user): Make the check more exhaustive by checking the optimality?</span></div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a876e41aaef1635d059d9d79dd08bbfc3"> 638</a></span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a876e41aaef1635d059d9d79dd08bbfc3">check_result_</a>;</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  </div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="comment">// Statistics about this class.</span></div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"><a class="line" href="classoperations__research_1_1GenericMaxFlow.html#a7c6fc06ca542eed0ff0b6ed4b1ecbcda"> 641</a></span>  <span class="keyword">mutable</span> StatsGroup <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a7c6fc06ca542eed0ff0b6ed4b1ecbcda">stats_</a>;</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  </div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  DISALLOW_COPY_AND_ASSIGN(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html">GenericMaxFlow</a>);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> };</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="preprocessor">#if !SWIG</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  </div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment">// Default instance MaxFlow that uses StarGraph. Note that we cannot just use a</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment">// typedef because of dependent code expecting MaxFlow to be a real class.</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment">// TODO(user): Modify this code and remove it.</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlow.html"> 652</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1MaxFlow.html">MaxFlow</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1GenericMaxFlow.html">GenericMaxFlow</a><StarGraph> {</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"><a class="line" href="classoperations__research_1_1MaxFlow.html#a591efdde87d4b90a85680d4f60dbc88a"> 654</a></span>  <a class="code" href="classoperations__research_1_1MaxFlow.html#a591efdde87d4b90a85680d4f60dbc88a">MaxFlow</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1EbertGraph.html">StarGraph</a>* <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>, <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> source, <a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">NodeIndex</a> target)</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  : <a class="code" href="classoperations__research_1_1GenericMaxFlow.html">GenericMaxFlow</a>(<a class="code" href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc">graph</a>, source, target) {}</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span> };</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  </div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="preprocessor">#endif // SWIG</span></div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  </div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a8e12342fc420701fbffd97025421575a"> 661</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a8e12342fc420701fbffd97025421575a">PriorityQueueWithRestrictedPush<Element, IntegerPriority>::IsEmpty</a>()<span class="keyword"></span></div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="keywordflow">return</span> even_queue_.empty() && odd_queue_.empty();</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span> }</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  </div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#aa71d36872f416feaa853788a7a7a7ef8"> 667</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#aa71d36872f416feaa853788a7a7a7ef8">PriorityQueueWithRestrictedPush<Element, IntegerPriority>::Clear</a>() {</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  even_queue_.clear();</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  odd_queue_.clear();</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span> }</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  </div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a83681186fdc5615ec1185ad4075e1023"> 673</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a83681186fdc5615ec1185ad4075e1023">PriorityQueueWithRestrictedPush<Element, IntegerPriority>::Push</a>(</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  Element element, IntegerPriority priority) {</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// Since users may rely on it, we DCHECK the exact condition.</span></div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  DCHECK(even_queue_.empty() || priority >= even_queue_.back().second - 1);</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  DCHECK(odd_queue_.empty() || priority >= odd_queue_.back().second - 1);</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  </div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// Note that the DCHECK() below are less restrictive than the ones above but</span></div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="comment">// check a necessary and sufficient condition for the priority queue to behave</span></div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// as expected.</span></div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">if</span> (priority & 1) {</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  DCHECK(odd_queue_.empty() || priority >= odd_queue_.back().second);</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  odd_queue_.push_back(std::make_pair(element, priority));</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  DCHECK(even_queue_.empty() || priority >= even_queue_.back().second);</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  even_queue_.push_back(std::make_pair(element, priority));</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span> }</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  </div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"><a class="line" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#af355586ee86be2298efe2e81367eeffe"> 692</a></span> Element <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#af355586ee86be2298efe2e81367eeffe">PriorityQueueWithRestrictedPush<Element, IntegerPriority>::Pop</a>() {</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  DCHECK(!IsEmpty());</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (even_queue_.empty()) <span class="keywordflow">return</span> PopBack(&odd_queue_);</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keywordflow">if</span> (odd_queue_.empty()) <span class="keywordflow">return</span> PopBack(&even_queue_);</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">if</span> (odd_queue_.back().second > even_queue_.back().second) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keywordflow">return</span> PopBack(&odd_queue_);</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">return</span> PopBack(&even_queue_);</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  }</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span> }</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  </div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="keyword">template</span> <<span class="keyword">typename</span> Element, <span class="keyword">typename</span> IntegerPriority></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span> Element <a class="code" href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html">PriorityQueueWithRestrictedPush<Element, IntegerPriority>::PopBack</a>(</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  std::vector<std::pair<Element, IntegerPriority> >* queue) {</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  DCHECK(!queue->empty());</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  Element element = queue->back().first;</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  queue->pop_back();</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">return</span> element;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span> }</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  </div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="preprocessor">#endif // OR_TOOLS_GRAPH_MAX_FLOW_H_</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_abf8c6fcb7d9c9fa39e283d086f0bb345"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#abf8c6fcb7d9c9fa39e283d086f0bb345">operations_research::GenericMaxFlow::status_</a></div><div class="ttdeci">Status status_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00606">max_flow.h:606</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a2b834b1bfbaef46bbf4a3f991a26f9a3"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a2b834b1bfbaef46bbf4a3f991a26f9a3">operations_research::GenericMaxFlow::bfs_queue_</a></div><div class="ttdeci">std::vector< NodeIndex > bfs_queue_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00611">max_flow.h:611</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a6b27587e2eba1f139e5b5b2609315aaa"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a6b27587e2eba1f139e5b5b2609315aaa">operations_research::GenericMaxFlow::SetUseGlobalUpdate</a></div><div class="ttdeci">void SetUseGlobalUpdate(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00414">max_flow.h:414</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::GenericMaxFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00365">max_flow.h:365</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlow_html_a591efdde87d4b90a85680d4f60dbc88a"><div class="ttname"><a href="classoperations__research_1_1MaxFlow.html#a591efdde87d4b90a85680d4f60dbc88a">operations_research::MaxFlow::MaxFlow</a></div><div class="ttdeci">MaxFlow(const StarGraph *graph, NodeIndex source, NodeIndex target)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00654">max_flow.h:654</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::SimpleMaxFlow::OPTIMAL</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00183">max_flow.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html_a83681186fdc5615ec1185ad4075e1023"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a83681186fdc5615ec1185ad4075e1023">operations_research::PriorityQueueWithRestrictedPush::Push</a></div><div class="ttdeci">void Push(Element element, IntegerPriority priority)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00673">max_flow.h:673</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a4d39b4f2db0792ccce2a922c74f43ecf"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a4d39b4f2db0792ccce2a922c74f43ecf">operations_research::SimpleMaxFlow::CreateFlowModelOfLastSolve</a></div><div class="ttdeci">FlowModel CreateFlowModelOfLastSolve()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ae93d8aa8c02df69fd88f9cdd1463bae3"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ae93d8aa8c02df69fd88f9cdd1463bae3">operations_research::GenericMaxFlow::ProcessNodeByHeight</a></div><div class="ttdeci">void ProcessNodeByHeight(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00421">max_flow.h:421</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a189d42cc721a58aa0b397cc44da875b7"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a189d42cc721a58aa0b397cc44da875b7">operations_research::GenericMaxFlow::IsAdmissible</a></div><div class="ttdeci">bool IsAdmissible(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00430">max_flow.h:430</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a9d8699dbc3e3b9cadc36d4fd5ee29dce"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a9d8699dbc3e3b9cadc36d4fd5ee29dce">operations_research::SimpleMaxFlow::AddArcWithCapacity</a></div><div class="ttdeci">ArcIndex AddArcWithCapacity(NodeIndex tail, NodeIndex head, FlowQuantity capacity)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a208812d23c7f00cbc76419a41038e7f1"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a208812d23c7f00cbc76419a41038e7f1">operations_research::SimpleMaxFlow::Solve</a></div><div class="ttdeci">Status Solve(NodeIndex source, NodeIndex sink)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ac0290c8f8892c50d7b29e9770fda4923"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ac0290c8f8892c50d7b29e9770fda4923">operations_research::GenericMaxFlow::ComputeReachableNodes</a></div><div class="ttdeci">void ComputeReachableNodes(NodeIndex start, std::vector< NodeIndex > *result)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a8b98114a0a6beb83e5b36e4e461659fd"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a8b98114a0a6beb83e5b36e4e461659fd">operations_research::GenericMaxFlow::node_in_bfs_queue_</a></div><div class="ttdeci">std::vector< bool > node_in_bfs_queue_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00610">max_flow.h:610</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a10bcb8f7f63b390821ae5e95fe4822cc"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a10bcb8f7f63b390821ae5e95fe4822cc">operations_research::GenericMaxFlow::graph</a></div><div class="ttdeci">const Graph * graph() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00338">max_flow.h:338</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a24f768765349e100ca2ef7697d1b52d5"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a24f768765349e100ca2ef7697d1b52d5">operations_research::GenericMaxFlow::SaturateOutgoingArcsFromSource</a></div><div class="ttdeci">bool SaturateOutgoingArcsFromSource()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html">operations_research::PriorityQueueWithRestrictedPush</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00264">max_flow.h:264</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a28b52dfd2da6e91a8e1e0d039c1d4154"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a28b52dfd2da6e91a8e1e0d039c1d4154">operations_research::GenericMaxFlow::GlobalUpdate</a></div><div class="ttdeci">void GlobalUpdate()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a3b2203f6789a10763c6ae978bf26b402"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a3b2203f6789a10763c6ae978bf26b402">operations_research::GenericMaxFlow::use_global_update_</a></div><div class="ttdeci">bool use_global_update_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00614">max_flow.h:614</a></div></div>
|
|
<div class="ttc" id="anamespaceutil_html_a2f76166dbe0c4055a1f256235ad00478"><div class="ttname"><a href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">util::Graph</a></div><div class="ttdeci">ListGraph Graph</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l02356">graph.h:2356</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html_af355586ee86be2298efe2e81367eeffe"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#af355586ee86be2298efe2e81367eeffe">operations_research::PriorityQueueWithRestrictedPush::Pop</a></div><div class="ttdeci">Element Pop()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00692">max_flow.h:692</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ac17ea9ef2dc1b5eace76f625abe36475"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ac17ea9ef2dc1b5eace76f625abe36475">operations_research::GenericMaxFlow::IsArcValid</a></div><div class="ttdeci">bool IsArcValid(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a876e41aaef1635d059d9d79dd08bbfc3"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a876e41aaef1635d059d9d79dd08bbfc3">operations_research::GenericMaxFlow::check_result_</a></div><div class="ttdeci">bool check_result_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00638">max_flow.h:638</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html_a3b2c821405c1875d5f8975e1ceae6a60"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a3b2c821405c1875d5f8975e1ceae6a60">operations_research::PriorityQueueWithRestrictedPush::PriorityQueueWithRestrictedPush</a></div><div class="ttdeci">PriorityQueueWithRestrictedPush()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00266">max_flow.h:266</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a38f480b60f3812345680d2267770ee5c"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a38f480b60f3812345680d2267770ee5c">operations_research::GenericMaxFlow::SetArcFlow</a></div><div class="ttdeci">void SetArcFlow(ArcIndex arc, FlowQuantity new_flow)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_af412987a2f98057ca8c6015782418eac"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#af412987a2f98057ca8c6015782418eac">operations_research::GenericMaxFlow::GetSinkNodeIndex</a></div><div class="ttdeci">NodeIndex GetSinkNodeIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00349">max_flow.h:349</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdef"><b>Definition:</b> <a href="christofides_8h_source.html#l00033">christofides.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_afc300bdfdbe5ce3296bacd00acce0b3f"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#afc300bdfdbe5ce3296bacd00acce0b3f">operations_research::GenericMaxFlow::active_node_by_height_</a></div><div class="ttdeci">PriorityQueueWithRestrictedPush< NodeIndex, NodeHeight > active_node_by_height_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00597">max_flow.h:597</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a942f29030f08426e7e318204e987e2f7"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a942f29030f08426e7e318204e987e2f7">operations_research::GenericMaxFlow::Solve</a></div><div class="ttdeci">bool Solve()</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a03fc0981d2d99da114ccd8b3abc0c6e1"><div class="ttname"><a href="namespaceoperations__research.html#a03fc0981d2d99da114ccd8b3abc0c6e1">operations_research::QuantityArray</a></div><div class="ttdeci">ZVector< FlowQuantity > QuantityArray</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00209">ebert_graph.h:209</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aac87a51b41d88b6976a12007bae9b91d"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aac87a51b41d88b6976a12007bae9b91d">operations_research::GenericMaxFlow::CheckResult</a></div><div class="ttdeci">bool CheckResult() const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad28be43d46715cda54108a189081d139"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad28be43d46715cda54108a189081d139">operations_research::GenericMaxFlow::RefineWithGlobalUpdate</a></div><div class="ttdeci">void RefineWithGlobalUpdate()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#a8e12342fc420701fbffd97025421575a">operations_research::PriorityQueueWithRestrictedPush::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00661">max_flow.h:661</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_aa5f729a6274027e5e5478e4bd76603ca"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca">operations_research::SimpleMaxFlow::Head</a></div><div class="ttdeci">NodeIndex Head(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html">operations_research::GenericMaxFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00144">max_flow.h:144</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_adb1490a44086db009cdb51f854a02a65"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#adb1490a44086db009cdb51f854a02a65">operations_research::GenericMaxFlow::status</a></div><div class="ttdeci">Status status() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00343">max_flow.h:343</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a0d012d3907b8306ddfc1a7089342fbe2"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a0d012d3907b8306ddfc1a7089342fbe2">operations_research::GenericMaxFlow::OutgoingArcIterator</a></div><div class="ttdeci">Graph::OutgoingArcIterator OutgoingArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00319">max_flow.h:319</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a7898be8b7efbfe53a58fcf621cf41315"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a7898be8b7efbfe53a58fcf621cf41315">operations_research::SimpleMaxFlow::NumArcs</a></div><div class="ttdeci">ArcIndex NumArcs() const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a2a420ad8221c326064736ccf148d2f93"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a2a420ad8221c326064736ccf148d2f93">operations_research::SimpleMaxFlow::Flow</a></div><div class="ttdeci">FlowQuantity Flow(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad2ab85b2912dbf12804d3d1ddea9ec15"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad2ab85b2912dbf12804d3d1ddea9ec15">operations_research::GenericMaxFlow::ArcIndexArray</a></div><div class="ttdeci">ZVector< ArcIndex > ArcIndexArray</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00323">max_flow.h:323</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">operations_research::SimpleMaxFlow::BAD_INPUT</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00192">max_flow.h:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a7ba7917e55551f771954c4323992a9ab"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a7ba7917e55551f771954c4323992a9ab">operations_research::GenericMaxFlow::SetCapacityAndClearFlow</a></div><div class="ttdeci">void SetCapacityAndClearFlow(ArcIndex arc, FlowQuantity capacity)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00442">max_flow.h:442</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_af3a76f97fe869af7137bbc9a165353b1"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#af3a76f97fe869af7137bbc9a165353b1">operations_research::GenericMaxFlow::IsArcDirect</a></div><div class="ttdeci">bool IsArcDirect(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad88eea96f82ba29e252f3e07cdb84378"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad88eea96f82ba29e252f3e07cdb84378">operations_research::GenericMaxFlow::graph_</a></div><div class="ttdeci">const Graph * graph_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00547">max_flow.h:547</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ab478e83cea51fd1e9656030ea4667286"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ab478e83cea51fd1e9656030ea4667286">operations_research::GenericMaxFlow::residual_arc_capacity_</a></div><div class="ttdeci">QuantityArray residual_arc_capacity_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00581">max_flow.h:581</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad96578b8ab41d25a3daa9f219c168b9f"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad96578b8ab41d25a3daa9f219c168b9f">operations_research::GenericMaxFlow::check_input_</a></div><div class="ttdeci">bool check_input_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00634">max_flow.h:634</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aa4e5f2ba9abcf71460c68a4903abc7bc"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aa4e5f2ba9abcf71460c68a4903abc7bc">operations_research::GenericMaxFlow::SetCheckResult</a></div><div class="ttdeci">void SetCheckResult(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00420">max_flow.h:420</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a4ede8a987bfe0972a51942bbca22d4c1"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a4ede8a987bfe0972a51942bbca22d4c1">operations_research::GenericMaxFlow::GetSourceSideMinCut</a></div><div class="ttdeci">void GetSourceSideMinCut(std::vector< NodeIndex > *result)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html">operations_research::SimpleMaxFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00152">max_flow.h:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_ac7bfd46bed70e12f118aa53df0c26769"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#ac7bfd46bed70e12f118aa53df0c26769">operations_research::SimpleMaxFlow::SetArcCapacity</a></div><div class="ttdeci">void SetArcCapacity(ArcIndex arc, FlowQuantity capacity)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_af4b75883cbba15f442c627f5da96f470"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#af4b75883cbba15f442c627f5da96f470">operations_research::GenericMaxFlow::Discharge</a></div><div class="ttdeci">void Discharge(NodeIndex node)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba0e6873a155f86a4695f463bf8601d05f">operations_research::MaxFlowStatusClass::NOT_SOLVED</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00303">max_flow.h:303</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a2212ce00ee245370c5cb71234244027a"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a2212ce00ee245370c5cb71234244027a">operations_research::GenericMaxFlow::DebugString</a></div><div class="ttdeci">std::string DebugString(const std::string &context, ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab161c9ccc8667340cc3dc656d490f260"><div class="ttname"><a href="namespaceoperations__research.html#ab161c9ccc8667340cc3dc656d490f260">operations_research::FlowQuantity</a></div><div class="ttdeci">int64 FlowQuantity</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00202">ebert_graph.h:202</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ab49dbdb731f80e626e575bdf66835f46"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46">operations_research::GenericMaxFlow::Tail</a></div><div class="ttdeci">NodeIndex Tail(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00533">max_flow.h:533</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1EbertGraph_html"><div class="ttname"><a href="classoperations__research_1_1EbertGraph.html">operations_research::EbertGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00188">ebert_graph.h:188</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a4ede8a987bfe0972a51942bbca22d4c1"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a4ede8a987bfe0972a51942bbca22d4c1">operations_research::SimpleMaxFlow::GetSourceSideMinCut</a></div><div class="ttdeci">void GetSourceSideMinCut(std::vector< NodeIndex > *result)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a7316c54af53df2e1f2ebc3d7fa1d5c45"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a7316c54af53df2e1f2ebc3d7fa1d5c45">operations_research::GenericMaxFlow::InitializeActiveNodeContainer</a></div><div class="ttdeci">void InitializeActiveNodeContainer()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a2cb1ce0e6ac75b050ffc3a7bfd35a8b2"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a2cb1ce0e6ac75b050ffc3a7bfd35a8b2">operations_research::GenericMaxFlow::kMaxFlowQuantity</a></div><div class="ttdeci">static const FlowQuantity kMaxFlowQuantity</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00544">max_flow.h:544</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_acef9fcefb0d5124677a8a9b460c30410"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#acef9fcefb0d5124677a8a9b460c30410">operations_research::GenericMaxFlow::GenericMaxFlow</a></div><div class="ttdeci">GenericMaxFlow(const Graph *graph, NodeIndex source, NodeIndex sink)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a89970809d6caccf0fc1ba38d7d955254"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a89970809d6caccf0fc1ba38d7d955254">operations_research::GenericMaxFlow::GetAndRemoveFirstActiveNode</a></div><div class="ttdeci">NodeIndex GetAndRemoveFirstActiveNode()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00460">max_flow.h:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_ab49dbdb731f80e626e575bdf66835f46"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#ab49dbdb731f80e626e575bdf66835f46">operations_research::SimpleMaxFlow::Tail</a></div><div class="ttdeci">NodeIndex Tail(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac2811be86dd03c6735e3b0db51ad914f">operations_research::MaxFlowStatusClass::BAD_INPUT</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00306">max_flow.h:306</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlow_html"><div class="ttname"><a href="classoperations__research_1_1MaxFlow.html">operations_research::MaxFlow</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00652">max_flow.h:652</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_abab657a2626df3ab99dfd21d811ff43c"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#abab657a2626df3ab99dfd21d811ff43c">operations_research::GenericMaxFlow::~GenericMaxFlow</a></div><div class="ttdeci">virtual ~GenericMaxFlow()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00335">max_flow.h:335</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70baef3d63bf3419a0e33cd86b58fadc640b"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70baef3d63bf3419a0e33cd86b58fadc640b">operations_research::MaxFlowStatusClass::INT_OVERFLOW</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00305">max_flow.h:305</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a865dfd15177ea8b4cd75a34ab9cee1b1"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a865dfd15177ea8b4cd75a34ab9cee1b1">operations_research::SimpleMaxFlow::OptimalFlow</a></div><div class="ttdeci">FlowQuantity OptimalFlow() const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_af337463a7577a73e5140bfe6518852b1"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#af337463a7577a73e5140bfe6518852b1">operations_research::GenericMaxFlow::IsActive</a></div><div class="ttdeci">bool IsActive(NodeIndex node) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00437">max_flow.h:437</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">operations_research::SimpleMaxFlow::POSSIBLE_OVERFLOW</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00190">max_flow.h:190</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a3be0f6fcc44bc6a4a1e976c1e60b31d0"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a3be0f6fcc44bc6a4a1e976c1e60b31d0">operations_research::SimpleMaxFlow::NumNodes</a></div><div class="ttdeci">NodeIndex NumNodes() const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::MaxFlowStatusClass::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00302">max_flow.h:302</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">operations_research::SimpleMaxFlow::BAD_RESULT</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00194">max_flow.h:194</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad45b094d532baccee95649c24192f87a"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad45b094d532baccee95649c24192f87a">operations_research::GenericMaxFlow::Refine</a></div><div class="ttdeci">void Refine()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a3a4afd902c22768de7955ba9983fb282"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a3a4afd902c22768de7955ba9983fb282">operations_research::GenericMaxFlow::PushFlowExcessBackToSource</a></div><div class="ttdeci">void PushFlowExcessBackToSource()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a187f8b09657eacdfef77202c595543f6"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a187f8b09657eacdfef77202c595543f6">operations_research::GenericMaxFlow::Relabel</a></div><div class="ttdeci">void Relabel(NodeIndex node)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a2a555ba2dc0a468e6fee4a0665b12272"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a2a555ba2dc0a468e6fee4a0665b12272">operations_research::GenericMaxFlow::CheckRelabelPrecondition</a></div><div class="ttdeci">bool CheckRelabelPrecondition(NodeIndex node) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a852dcceddb3bc2642eb867cc3663c0fe"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a852dcceddb3bc2642eb867cc3663c0fe">operations_research::GenericMaxFlow::NodeHeightArray</a></div><div class="ttdeci">ZVector< NodeHeight > NodeHeightArray</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00328">max_flow.h:328</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a5b7429be4ec8b98658d0b035261b1483"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a5b7429be4ec8b98658d0b035261b1483">operations_research::GenericMaxFlow::node_potential_</a></div><div class="ttdeci">NodeHeightArray node_potential_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00563">max_flow.h:563</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html">operations_research::MaxFlowStatusClass</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00300">max_flow.h:300</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ab9d95dc874e5c2d424cecd251fd7ff82"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ab9d95dc874e5c2d424cecd251fd7ff82">operations_research::GenericMaxFlow::IncomingArcIterator</a></div><div class="ttdeci">Graph::IncomingArcIterator IncomingArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00322">max_flow.h:322</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a277838ded7171a604a67babdbea05988"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a277838ded7171a604a67babdbea05988">operations_research::GenericMaxFlow::OutgoingOrOppositeIncomingArcIterator</a></div><div class="ttdeci">Graph::OutgoingOrOppositeIncomingArcIterator OutgoingOrOppositeIncomingArcIterator</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00321">max_flow.h:321</a></div></div>
|
|
<div class="ttc" id="agraph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_abedc5621560431c2527859bd5d1ab8fc"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#abedc5621560431c2527859bd5d1ab8fc">operations_research::GenericMaxFlow::PushFlow</a></div><div class="ttdeci">void PushFlow(FlowQuantity flow, ArcIndex arc)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::SimpleMaxFlow::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00180">max_flow.h:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a0f81f6e049ffb2b2a27c8e45dc0a25a0"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a0f81f6e049ffb2b2a27c8e45dc0a25a0">operations_research::GenericMaxFlow::InitializePreflow</a></div><div class="ttdeci">void InitializePreflow()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aab4ab1dc9be85072322b17c1f56fe208"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aab4ab1dc9be85072322b17c1f56fe208">operations_research::GenericMaxFlow::source_</a></div><div class="ttdeci">NodeIndex source_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00600">max_flow.h:600</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad3f0f2aad2e5ba39481e3aad8de1fcda"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad3f0f2aad2e5ba39481e3aad8de1fcda">operations_research::GenericMaxFlow::AugmentingPathExists</a></div><div class="ttdeci">bool AugmentingPathExists() const</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a272bcc4d6ee0e87a7fc430a5cb13c582"><div class="ttname"><a href="namespaceoperations__research.html#a272bcc4d6ee0e87a7fc430a5cb13c582">operations_research::NodeIndex</a></div><div class="ttdeci">int32 NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00192">ebert_graph.h:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a0b218e6bdef5560b441d7dc1b47d897f"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a0b218e6bdef5560b441d7dc1b47d897f">operations_research::SimpleMaxFlow::SimpleMaxFlow</a></div><div class="ttdeci">SimpleMaxFlow()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a44aa9e2f47277c91d8064c7126a2ff48"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a44aa9e2f47277c91d8064c7126a2ff48">operations_research::GenericMaxFlow::ArcIndex</a></div><div class="ttdeci">Graph::ArcIndex ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00318">max_flow.h:318</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a420abfd079f041eac775859ab19e644d"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a420abfd079f041eac775859ab19e644d">operations_research::GenericMaxFlow::PushActiveNode</a></div><div class="ttdeci">void PushActiveNode(const NodeIndex &node)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00468">max_flow.h:468</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aee97cd3a6def72d85d4685c134d11671"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aee97cd3a6def72d85d4685c134d11671">operations_research::GenericMaxFlow::sink_</a></div><div class="ttdeci">NodeIndex sink_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00603">max_flow.h:603</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_ad8ca9f0f372e03f5cf3af1e163230792"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#ad8ca9f0f372e03f5cf3af1e163230792">operations_research::GenericMaxFlow::GetSinkSideMinCut</a></div><div class="ttdeci">void GetSinkSideMinCut(std::vector< NodeIndex > *result)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a4549e7f9a27adb25091a91101b8fddbd"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a4549e7f9a27adb25091a91101b8fddbd">operations_research::GenericMaxFlow::SetUseTwoPhaseAlgorithm</a></div><div class="ttdeci">void SetUseTwoPhaseAlgorithm(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00418">max_flow.h:418</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a33996084cb5b29f77cc6ee673b6ece51"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a33996084cb5b29f77cc6ee673b6ece51">operations_research::GenericMaxFlow::process_node_by_height_</a></div><div class="ttdeci">bool process_node_by_height_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00629">max_flow.h:629</a></div></div>
|
|
<div class="ttc" id="aebert__graph_8h_html"><div class="ttname"><a href="ebert__graph_8h.html">ebert_graph.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a798f41062d76af3baabada0c4c0580ea"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a798f41062d76af3baabada0c4c0580ea">operations_research::GenericMaxFlow::NodeHeight</a></div><div class="ttdeci">NodeIndex NodeHeight</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00327">max_flow.h:327</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a689c39e9d4a7bdb9d64e270b8c9abcbd"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a689c39e9d4a7bdb9d64e270b8c9abcbd">operations_research::GenericMaxFlow::use_two_phase_algorithm_</a></div><div class="ttdeci">bool use_two_phase_algorithm_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00621">max_flow.h:621</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a12ffc143b8d66de80c07572cc8509037"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a12ffc143b8d66de80c07572cc8509037">operations_research::GenericMaxFlow::CheckInputConsistency</a></div><div class="ttdeci">bool CheckInputConsistency() const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1PriorityQueueWithRestrictedPush_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1PriorityQueueWithRestrictedPush.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::PriorityQueueWithRestrictedPush::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00667">max_flow.h:667</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_a9dcd8610149406a1593d2a0725290482"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#a9dcd8610149406a1593d2a0725290482">operations_research::SimpleMaxFlow::Capacity</a></div><div class="ttdeci">FlowQuantity Capacity(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a142146c1af2855fc821d7bd4c0af6130"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a142146c1af2855fc821d7bd4c0af6130">operations_research::GenericMaxFlow::GetOptimalFlow</a></div><div class="ttdeci">FlowQuantity GetOptimalFlow() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00361">max_flow.h:361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba2579881e7c83261bc21bafb5a5c92cad">operations_research::MaxFlowStatusClass::OPTIMAL</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00304">max_flow.h:304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1MaxFlowStatusClass_html_a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4"><div class="ttname"><a href="classoperations__research_1_1MaxFlowStatusClass.html#a67a0db04d321a74b7e7fcfd3f1a3f70bac76ecfd837bdc6d4150bb02c403356e4">operations_research::MaxFlowStatusClass::BAD_RESULT</a></div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00307">max_flow.h:307</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_af63274e5211be9578b29f56f29936964"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#af63274e5211be9578b29f56f29936964">operations_research::GenericMaxFlow::node_excess_</a></div><div class="ttdeci">QuantityArray node_excess_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00550">max_flow.h:550</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_afbd2be8210b3c04ac5ee3a879f1e62de"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#afbd2be8210b3c04ac5ee3a879f1e62de">operations_research::GenericMaxFlow::CreateFlowModel</a></div><div class="ttdeci">FlowModel CreateFlowModel()</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a19193cb3045a42a4154d3860b92dc65b"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a19193cb3045a42a4154d3860b92dc65b">operations_research::GenericMaxFlow::active_nodes_</a></div><div class="ttdeci">std::vector< NodeIndex > active_nodes_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00590">max_flow.h:590</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aa5f729a6274027e5e5478e4bd76603ca"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aa5f729a6274027e5e5478e4bd76603ca">operations_research::GenericMaxFlow::Head</a></div><div class="ttdeci">NodeIndex Head(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00532">max_flow.h:532</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a3702055ec6affa60e6862cd0e63f9a7b"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a3702055ec6affa60e6862cd0e63f9a7b">operations_research::GenericMaxFlow::first_admissible_arc_</a></div><div class="ttdeci">ArcIndexArray first_admissible_arc_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00584">max_flow.h:584</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a9dcd8610149406a1593d2a0725290482"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a9dcd8610149406a1593d2a0725290482">operations_research::GenericMaxFlow::Capacity</a></div><div class="ttdeci">FlowQuantity Capacity(ArcIndex arc) const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00375">max_flow.h:375</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a21776d0248204801a49c42b46902c1a1"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a21776d0248204801a49c42b46902c1a1">operations_research::GenericMaxFlow::SetArcCapacity</a></div><div class="ttdeci">void SetArcCapacity(ArcIndex arc, FlowQuantity new_capacity)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a29b76a85638e0b4ce0f715c5bbba3f81"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a29b76a85638e0b4ce0f715c5bbba3f81">operations_research::GenericMaxFlow::GetSourceNodeIndex</a></div><div class="ttdeci">NodeIndex GetSourceNodeIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00346">max_flow.h:346</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SimpleMaxFlow_html_ad8ca9f0f372e03f5cf3af1e163230792"><div class="ttname"><a href="classoperations__research_1_1SimpleMaxFlow.html#ad8ca9f0f372e03f5cf3af1e163230792">operations_research::SimpleMaxFlow::GetSinkSideMinCut</a></div><div class="ttdeci">void GetSinkSideMinCut(std::vector< NodeIndex > *result)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a4ddaeee9414a17257bb052c459325caf"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a4ddaeee9414a17257bb052c459325caf">operations_research::GenericMaxFlow::NodeIndex</a></div><div class="ttdeci">Graph::NodeIndex NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00317">max_flow.h:317</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_adf24020c0638fbd28d483762e6247ff5"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#adf24020c0638fbd28d483762e6247ff5">operations_research::GenericMaxFlow::Opposite</a></div><div class="ttdeci">ArcIndex Opposite(ArcIndex arc) const</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a7c6fc06ca542eed0ff0b6ed4b1ecbcda"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a7c6fc06ca542eed0ff0b6ed4b1ecbcda">operations_research::GenericMaxFlow::stats_</a></div><div class="ttdeci">StatsGroup stats_</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00641">max_flow.h:641</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_aa76638d2f8eddf2c3d9778b3c1285010"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#aa76638d2f8eddf2c3d9778b3c1285010">operations_research::GenericMaxFlow::SetCheckInput</a></div><div class="ttdeci">void SetCheckInput(bool value)</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00419">max_flow.h:419</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1GenericMaxFlow_html_a8f70d2ab94c2c3a7f05c6f2a3bc18573"><div class="ttname"><a href="classoperations__research_1_1GenericMaxFlow.html#a8f70d2ab94c2c3a7f05c6f2a3bc18573">operations_research::GenericMaxFlow::IsEmptyActiveNodeContainer</a></div><div class="ttdeci">bool IsEmptyActiveNodeContainer()</div><div class="ttdef"><b>Definition:</b> <a href="max__flow_8h_source.html#l00477">max_flow.h:477</a></div></div>
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|