more linear doc

2019-07-15 17:42:24 -07:00
parent 8982bcac1b
commit 0ac3fa17eb
1885 changed files with 4324 additions and 4431 deletions
--- a/docs/cpp_algorithms/annotated.html
+++ b/docs/cpp_algorithms/annotated.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/classes.html
+++ b/docs/cpp_algorithms/classes.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html
+++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver-members.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -52,7 +53,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1KnapsackS
 <table class="directory">
  <tr class="even"><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#a170ccb08012026c5a438fcf16feb6faa">BestSolutionContains</a>(int item_id) const</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2950d2690930dd8562b40d29bb7002e">GetName</a>() const</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
-  <tr class="even"><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#aca019151f60942f2e7245874bb89cd62">Init</a>(const std::vector&lt; int64 &gt; &amp;profits, const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;weights, const std::vector&lt; int64 &gt; &amp;capacities)</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2a0397c061a1cf0bfc759b35f23e463">Init</a>(const std::vector&lt; int64 &gt; &amp;profits, const std::vector&lt; std::vector&lt; int64 &gt; &gt; &amp;weights, const std::vector&lt; int64 &gt; &amp;capacities)</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#a96f960b29496f637af7a3eeb10e606ab">IsSolutionOptimal</a>() const</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#a81ce17438663c39f7793e8db92ff1893aa6c3b9157b2506f5a53b0c73165c8f9b">KNAPSACK_64ITEMS_SOLVER</a> enum value</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#a81ce17438663c39f7793e8db92ff1893a4d72c45990d1a81e3f5bcdaf6de72096">KNAPSACK_BRUTE_FORCE_SOLVER</a> enum value</td><td class="entry"><a class="el" href="classoperations__research_1_1KnapsackSolver.html">operations_research::KnapsackSolver</a></td><td class="entry"></td></tr>
--- a/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver.html
+++ b/docs/cpp_algorithms/classoperations__research_1_1KnapsackSolver.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -65,7 +66,7 @@ $(document).ready(function(){initNavTree('classoperations__research_1_1KnapsackS
 <p>For instance to solve a 2-dimensional knapsack problem with 9 items, one just has to feed a profit vector with the 9 profits, a vector of 2 vectors for weights, and a vector of capacities. E.g.:</p>
 <p><b>Python:</b> </p>
 <div class="fragment"><div class="line">profits = [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ]</div><div class="line">weights = [ [ 1, 2, 3, 4, 5, 6, 7, 8, 9 ],</div><div class="line">            [ 1, 1, 1, 1, 1, 1, 1, 1, 1 ]</div><div class="line">          ]</div><div class="line">capacities = [ 34, 4 ]</div><div class="line"></div><div class="line">solver = pywrapknapsack_solver.KnapsackSolver(</div><div class="line">    pywrapknapsack_solver.KnapsackSolver</div><div class="line">        .KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,</div><div class="line">    <span class="stringliteral">&#39;Multi-dimensional solver&#39;</span>)</div><div class="line">solver.Init(profits, weights, capacities)</div><div class="line">profit = solver.Solve()</div></div><!-- fragment --><p><b>C++</b>:</p>
-<div class="fragment"><div class="line"><span class="keyword">const</span> std::vector&lt;int64&gt; profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };</div><div class="line"><span class="keyword">const</span> std::vector&lt;std::vector&lt;int64&gt;&gt; weights = </div><div class="line">    { { 1, 2, 3, 4, 5, 6, 7, 8, 9 },</div><div class="line">      { 1, 1, 1, 1, 1, 1, 1, 1, 1 } };</div><div class="line"><span class="keyword">const</span> std::vector&lt;int64&gt; capacities = { 34, 4 };</div><div class="line"></div><div class="line"><a class="code" href="classoperations__research_1_1KnapsackSolver.html#a7638cb76df7cb79d956dda62d179a554">KnapsackSolver</a> solver(</div><div class="line">    <a class="code" href="classoperations__research_1_1KnapsackSolver.html#a81ce17438663c39f7793e8db92ff1893ae8c15c25eaf606f5f853821aaabba164">KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER</a>,</div><div class="line">    <span class="stringliteral">&quot;Multi-dimensional solver&quot;</span>);</div><div class="line">solver.Init(profits, weights, capacities);</div><div class="line"><span class="keyword">const</span> int64 profit = solver.Solve();</div></div><!-- fragment --><p><b>Java:</b> </p>
+<div class="fragment"><div class="line"><span class="keyword">const</span> std::vector&lt;int64&gt; profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };</div><div class="line"><span class="keyword">const</span> std::vector&lt;std::vector&lt;int64&gt;&gt; weights =</div><div class="line">    { { 1, 2, 3, 4, 5, 6, 7, 8, 9 },</div><div class="line">      { 1, 1, 1, 1, 1, 1, 1, 1, 1 } };</div><div class="line"><span class="keyword">const</span> std::vector&lt;int64&gt; capacities = { 34, 4 };</div><div class="line"></div><div class="line"><a class="code" href="classoperations__research_1_1KnapsackSolver.html#a7638cb76df7cb79d956dda62d179a554">KnapsackSolver</a> solver(</div><div class="line">    <a class="code" href="classoperations__research_1_1KnapsackSolver.html#a81ce17438663c39f7793e8db92ff1893ae8c15c25eaf606f5f853821aaabba164">KnapsackSolver::KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER</a>,</div><div class="line">    <span class="stringliteral">&quot;Multi-dimensional solver&quot;</span>);</div><div class="line">solver.Init(profits, weights, capacities);</div><div class="line"><span class="keyword">const</span> int64 profit = solver.Solve();</div></div><!-- fragment --><p><b>Java:</b> </p>
 <div class="fragment"><div class="line"><span class="keyword">final</span> <span class="keywordtype">long</span>[] profits = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };</div><div class="line"><span class="keyword">final</span> <span class="keywordtype">long</span>[][] weights = { { 1, 2, 3, 4, 5, 6, 7, 8, 9 },</div><div class="line">       { 1, 1, 1, 1, 1, 1, 1, 1, 1 } };</div><div class="line"><span class="keyword">final</span> <span class="keywordtype">long</span>[] capacities = { 34, 4 };</div><div class="line"></div><div class="line"><a class="code" href="classoperations__research_1_1KnapsackSolver.html#a7638cb76df7cb79d956dda62d179a554">KnapsackSolver</a> solver = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1KnapsackSolver.html#a7638cb76df7cb79d956dda62d179a554">KnapsackSolver</a>(</div><div class="line">    <a class="code" href="classoperations__research_1_1KnapsackSolver.html#a7638cb76df7cb79d956dda62d179a554">KnapsackSolver</a>.SolverType.KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER,</div><div class="line">    <span class="stringliteral">&quot;Multi-dimensional solver&quot;</span>);</div><div class="line">solver.init(profits, weights, capacities);</div><div class="line"><span class="keyword">final</span> <span class="keywordtype">long</span> profit = solver.solve();</div></div><!-- fragment --> 
 <p class="definition">Definition at line <a class="el" href="knapsack__solver_8h_source.html#l00120">120</a> of file <a class="el" href="knapsack__solver_8h_source.html">knapsack_solver.h</a>.</p>
 </div><table class="memberdecls">
@@ -92,9 +93,9 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:ab36466b997fe3f25955461708061ce40"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac6d1a38c9a1c607e80d05720372ace4d"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#ac6d1a38c9a1c607e80d05720372ace4d">~KnapsackSolver</a> ()</td></tr>
 <tr class="separator:ac6d1a38c9a1c607e80d05720372ace4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aca019151f60942f2e7245874bb89cd62"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#aca019151f60942f2e7245874bb89cd62">Init</a> (const std::vector&lt; int64 &gt; &amp;profits, const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;weights, const std::vector&lt; int64 &gt; &amp;capacities)</td></tr>
-<tr class="memdesc:aca019151f60942f2e7245874bb89cd62"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the solver and enters the problem to be solved.  <a href="#aca019151f60942f2e7245874bb89cd62">More...</a><br /></td></tr>
-<tr class="separator:aca019151f60942f2e7245874bb89cd62"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ad2a0397c061a1cf0bfc759b35f23e463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2a0397c061a1cf0bfc759b35f23e463">Init</a> (const std::vector&lt; int64 &gt; &amp;profits, const std::vector&lt; std::vector&lt; int64 &gt; &gt; &amp;weights, const std::vector&lt; int64 &gt; &amp;capacities)</td></tr>
+<tr class="memdesc:ad2a0397c061a1cf0bfc759b35f23e463"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the solver and enters the problem to be solved.  <a href="#ad2a0397c061a1cf0bfc759b35f23e463">More...</a><br /></td></tr>
+<tr class="separator:ad2a0397c061a1cf0bfc759b35f23e463"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7c3b5825c8effd86de03a610d1a38ed7"><td class="memItemLeft" align="right" valign="top">int64&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classoperations__research_1_1KnapsackSolver.html#a7c3b5825c8effd86de03a610d1a38ed7">Solve</a> ()</td></tr>
 <tr class="memdesc:a7c3b5825c8effd86de03a610d1a38ed7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solves the problem and returns the profit of the optimal solution.  <a href="#a7c3b5825c8effd86de03a610d1a38ed7">More...</a><br /></td></tr>
 <tr class="separator:a7c3b5825c8effd86de03a610d1a38ed7"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -131,32 +132,24 @@ Public Member Functions</h2></td></tr>
 <p>This enum is passed to the constructor of the <a class="el" href="classoperations__research_1_1KnapsackSolver.html" title="This library solves knapsack problems.">KnapsackSolver</a> object. It selects which solving method will be used. </p>
 <table class="fieldtable">
 <tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893a4d72c45990d1a81e3f5bcdaf6de72096"></a>KNAPSACK_BRUTE_FORCE_SOLVER&#160;</td><td class="fielddoc"><p>Brute force method. </p>
-<pre class="fragment">Limited to 30 items and one dimension, this
-solver uses a brute force algorithm, ie. explores all possible states.
-Experiments show competitive performance for instances with less than
-15 items. </pre> </td></tr>
+<p>Limited to 30 items and one dimension, this solver uses a brute force algorithm, ie. explores all possible states. Experiments show competitive performance for instances with less than 15 items. </p>
+</td></tr>
 <tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893aa6c3b9157b2506f5a53b0c73165c8f9b"></a>KNAPSACK_64ITEMS_SOLVER&#160;</td><td class="fielddoc"><p>Optimized method for single dimension small problems. </p>
-<pre class="fragment">Limited to 64 items and one dimension, this
-solver uses a branch &amp; bound algorithm. This solver is about 4 times
-faster than KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER.
-</pre> </td></tr>
+<p>Limited to 64 items and one dimension, this solver uses a branch &amp; bound algorithm. This solver is about 4 times faster than KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER. </p>
+</td></tr>
 <tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893a9c02fa29c925bc1d37cba92490998132"></a>KNAPSACK_DYNAMIC_PROGRAMMING_SOLVER&#160;</td><td class="fielddoc"><p>Dynamic Programming approach for single dimension problems. </p>
-<pre class="fragment">Limited to one dimension, this solver is based on a dynamic programming
-algorithm. The time and space complexity is O(capacity *
-number_of_items).
-</pre> </td></tr>
+<p>Limited to one dimension, this solver is based on a dynamic programming algorithm. The time and space complexity is O(capacity * number_of_items). </p>
+</td></tr>
 <tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893ae1b7e0ea856a376a9c04130e0abdf812"></a>KNAPSACK_MULTIDIMENSION_CBC_MIP_SOLVER&#160;</td><td class="fielddoc"><p>CBC Based Solver. </p>
-<pre class="fragment"> This solver can deal with both large number of items and several
-dimensions. This solver is based on Integer Programming solver CBC.
-</pre> </td></tr>
+<pre class="fragment">This solver can deal with both large number of items and several
+</pre><p> dimensions. This solver is based on Integer Programming solver CBC. </p>
+</td></tr>
 <tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893ae8c15c25eaf606f5f853821aaabba164"></a>KNAPSACK_MULTIDIMENSION_BRANCH_AND_BOUND_SOLVER&#160;</td><td class="fielddoc"><p>Generic Solver. </p>
-<pre class="fragment">This solver can deal with both large number of items and several
-dimensions. This solver is based on branch and bound.
-</pre> </td></tr>
+<p>This solver can deal with both large number of items and several dimensions. This solver is based on branch and bound. </p>
+</td></tr>
 <tr><td class="fieldname"><a id="a81ce17438663c39f7793e8db92ff1893aa6d83fc5b8d17db1f82c1b414a4e8b20"></a>KNAPSACK_MULTIDIMENSION_SCIP_MIP_SOLVER&#160;</td><td class="fielddoc"><p>SCIP based solver. </p>
-<pre class="fragment">This solver can deal with both large number of items and several
-dimensions. This solver is based on Integer Programming solver SCIP.
-</pre> </td></tr>
+<p>This solver can deal with both large number of items and several dimensions. This solver is based on Integer Programming solver SCIP. </p>
+</td></tr>
 </table>

 <p class="definition">Definition at line <a class="el" href="knapsack__solver_8h_source.html#l00127">127</a> of file <a class="el" href="knapsack__solver_8h_source.html">knapsack_solver.h</a>.</p>
@@ -281,8 +274,8 @@ dimensions. This solver is based on Integer Programming solver SCIP.

 </div>
 </div>
-<a id="aca019151f60942f2e7245874bb89cd62"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#aca019151f60942f2e7245874bb89cd62">&#9670;&nbsp;</a></span>Init()</h2>
+<a id="ad2a0397c061a1cf0bfc759b35f23e463"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad2a0397c061a1cf0bfc759b35f23e463">&#9670;&nbsp;</a></span>Init()</h2>

 <div class="memitem">
 <div class="memproto">
@@ -296,7 +289,7 @@ dimensions. This solver is based on Integer Programming solver SCIP.
        <tr>
          <td class="paramkey"></td>
          <td></td>
-          <td class="paramtype">const std::vector&lt; std::vector&lt; int64 &gt;&gt; &amp;&#160;</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int64 &gt; &gt; &amp;&#160;</td>
          <td class="paramname"><em>weights</em>, </td>
        </tr>
        <tr>
@@ -373,7 +366,7 @@ dimensions. This solver is based on Integer Programming solver SCIP.
 <p>Time limit in seconds. </p>
 <p>When a finite time limit is set the solution obtained might not be optimal if the limit is reached. </p>

-<p class="definition">Definition at line <a class="el" href="knapsack__solver_8h_source.html#l00214">214</a> of file <a class="el" href="knapsack__solver_8h_source.html">knapsack_solver.h</a>.</p>
+<p class="definition">Definition at line <a class="el" href="knapsack__solver_8h_source.html#l00212">212</a> of file <a class="el" href="knapsack__solver_8h_source.html">knapsack_solver.h</a>.</p>

 </div>
 </div>
--- a/docs/cpp_algorithms/densedoublylinked__list_8h.html
+++ b/docs/cpp_algorithms/densedoublylinked__list_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -54,9 +50,7 @@ $(document).ready(function(){initNavTree('dense__doubly__linked__list_8h.html','
 <div class="title">dense_doubly_linked_list.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;ortools/base/logging.h&quot;</code><br />
-</div>
+
 <p><a href="dense__doubly__linked__list_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/densedoublylinked__list_8h_source.html
+++ b/docs/cpp_algorithms/densedoublylinked__list_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/dir_80dda7a75b0dfcf996988638a63eb03a.html
+++ b/docs/cpp_algorithms/dir_80dda7a75b0dfcf996988638a63eb03a.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li class="current"><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/dir_a7cc1eeded8f693d0da6c729bc88c45a.html
+++ b/docs/cpp_algorithms/dir_a7cc1eeded8f693d0da6c729bc88c45a.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li class="current"><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/dynamic__partition_8h.html
+++ b/docs/cpp_algorithms/dynamic__partition_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -54,10 +50,7 @@ $(document).ready(function(){initNavTree('dynamic__partition_8h.html','');});
 <div class="title">dynamic_partition.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;string&gt;</code><br />
-<code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;ortools/base/logging.h&quot;</code><br />
-</div>
+
 <p><a href="dynamic__partition_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/dynamic__partition_8h_source.html
+++ b/docs/cpp_algorithms/dynamic__partition_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/dynamic__permutation_8h.html
+++ b/docs/cpp_algorithms/dynamic__permutation_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -54,11 +50,7 @@ $(document).ready(function(){initNavTree('dynamic__permutation_8h.html','');});
 <div class="title">dynamic_permutation.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;memory&gt;</code><br />
-<code>#include &lt;set&gt;</code><br />
-<code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;ortools/base/logging.h&quot;</code><br />
-</div>
+
 <p><a href="dynamic__permutation_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/dynamic__permutation_8h_source.html
+++ b/docs/cpp_algorithms/dynamic__permutation_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/files.html
+++ b/docs/cpp_algorithms/files.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li class="current"><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/findgraphsymmetries_8h.html
+++ b/docs/cpp_algorithms/findgraphsymmetries_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -54,16 +50,7 @@ $(document).ready(function(){initNavTree('find__graph__symmetries_8h.html','');}
 <div class="title">find_graph_symmetries.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;memory&gt;</code><br />
-<code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;absl/time/time.h&quot;</code><br />
-<code>#include &quot;<a class="el" href="dynamic__partition_8h_source.html">ortools/algorithms/dynamic_partition.h</a>&quot;</code><br />
-<code>#include &quot;<a class="el" href="dynamic__permutation_8h_source.html">ortools/algorithms/dynamic_permutation.h</a>&quot;</code><br />
-<code>#include &quot;ortools/base/status.h&quot;</code><br />
-<code>#include &quot;ortools/graph/graph.h&quot;</code><br />
-<code>#include &quot;ortools/util/stats.h&quot;</code><br />
-<code>#include &quot;ortools/util/time_limit.h&quot;</code><br />
-</div>
+
 <p><a href="find__graph__symmetries_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/findgraphsymmetries_8h_source.html
+++ b/docs/cpp_algorithms/findgraphsymmetries_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/functions.html
+++ b/docs/cpp_algorithms/functions.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
@@ -59,7 +60,7 @@ $(document).ready(function(){initNavTree('functions.html','');});
 : <a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2950d2690930dd8562b40d29bb7002e">operations_research::KnapsackSolver</a>
 </li>
 <li>Init()
-: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#aca019151f60942f2e7245874bb89cd62">operations_research::KnapsackSolver</a>
+: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2a0397c061a1cf0bfc759b35f23e463">operations_research::KnapsackSolver</a>
 </li>
 <li>IsSolutionOptimal()
 : <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a96f960b29496f637af7a3eeb10e606ab">operations_research::KnapsackSolver</a>
--- a/docs/cpp_algorithms/functions_enum.html
+++ b/docs/cpp_algorithms/functions_enum.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
--- a/docs/cpp_algorithms/functions_eval.html
+++ b/docs/cpp_algorithms/functions_eval.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
--- a/docs/cpp_algorithms/functions_func.html
+++ b/docs/cpp_algorithms/functions_func.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
@@ -59,7 +60,7 @@ $(document).ready(function(){initNavTree('functions_func.html','');});
 : <a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2950d2690930dd8562b40d29bb7002e">operations_research::KnapsackSolver</a>
 </li>
 <li>Init()
-: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#aca019151f60942f2e7245874bb89cd62">operations_research::KnapsackSolver</a>
+: <a class="el" href="classoperations__research_1_1KnapsackSolver.html#ad2a0397c061a1cf0bfc759b35f23e463">operations_research::KnapsackSolver</a>
 </li>
 <li>IsSolutionOptimal()
 : <a class="el" href="classoperations__research_1_1KnapsackSolver.html#a96f960b29496f637af7a3eeb10e606ab">operations_research::KnapsackSolver</a>
--- a/docs/cpp_algorithms/hungarian_8h.html
+++ b/docs/cpp_algorithms/hungarian_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -55,9 +51,7 @@ $(document).ready(function(){initNavTree('hungarian_8h.html','');});
 <div class="title">hungarian.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;absl/container/flat_hash_map.h&quot;</code><br />
-</div>
+
 <p><a href="hungarian_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/hungarian_8h_source.html
+++ b/docs/cpp_algorithms/hungarian_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/index.html
+++ b/docs/cpp_algorithms/index.html
@@ -23,6 +23,7 @@
      <li class="current"><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/knapsack__solver_8h.html
+++ b/docs/cpp_algorithms/knapsack__solver_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -55,17 +51,7 @@ $(document).ready(function(){initNavTree('knapsack__solver_8h.html','');});
 <div class="title">knapsack_solver.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;math.h&gt;</code><br />
-<code>#include &lt;memory&gt;</code><br />
-<code>#include &lt;string&gt;</code><br />
-<code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;absl/memory/memory.h&quot;</code><br />
-<code>#include &quot;ortools/base/basictypes.h&quot;</code><br />
-<code>#include &quot;ortools/base/integral_types.h&quot;</code><br />
-<code>#include &quot;ortools/base/logging.h&quot;</code><br />
-<code>#include &quot;ortools/base/macros.h&quot;</code><br />
-<code>#include &quot;ortools/util/time_limit.h&quot;</code><br />
-</div>
+
 <p><a href="knapsack__solver_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
--- a/docs/cpp_algorithms/knapsack__solver_8h_source.html
+++ b/docs/cpp_algorithms/knapsack__solver_8h_source.html
--- a/docs/cpp_algorithms/menudata.js
+++ b/docs/cpp_algorithms/menudata.js
@@ -24,4 +24,5 @@ for the JavaScript code in this file
 var menudata={children:[
 {text:"Main Page",url:"index.html"},
 {text:"Namespaces",url:"namespaces.html"},
-{text:"Classes",url:"annotated.html"}]}
+{text:"Classes",url:"annotated.html"},
+{text:"Files",url:"files.html"}]}
--- a/docs/cpp_algorithms/namespacemembers.html
+++ b/docs/cpp_algorithms/namespacemembers.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
--- a/docs/cpp_algorithms/namespacemembers_func.html
+++ b/docs/cpp_algorithms/namespacemembers_func.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow3" class="tabs2">
--- a/docs/cpp_algorithms/namespaceoperations__research.html
+++ b/docs/cpp_algorithms/namespaceoperations__research.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/namespaces.html
+++ b/docs/cpp_algorithms/namespaces.html
@@ -23,6 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
+      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
--- a/docs/cpp_algorithms/navtreedata.js
+++ b/docs/cpp_algorithms/navtreedata.js
@@ -26,13 +26,13 @@ var NAVTREE =
  [ "OR-Tools", "index.html", [
    [ "Namespaces", "namespaces.html", null ],
    [ "Classes", "annotated.html", null ],
-    [ "File List", "files.html", "files" ]
+    [ "Files", "files.html", null ]
  ] ]
 ];

 var NAVTREEINDEX =
 [
-"dense__doubly__linked__list_8h.html"
+"index.html"
 ];

 var SYNCONMSG = 'click to disable panel synchronisation';
--- a/docs/cpp_algorithms/navtreeindex0.js
+++ b/docs/cpp_algorithms/navtreeindex0.js
@@ -1,22 +1,5 @@
 var NAVTREEINDEX0 =
 {
-"dense__doubly__linked__list_8h.html":[2,0],
-"dense__doubly__linked__list_8h_source.html":[2,0],
-"dynamic__partition_8h.html":[2,1],
-"dynamic__partition_8h_source.html":[2,1],
-"dynamic__permutation_8h.html":[2,2],
-"dynamic__permutation_8h_source.html":[2,2],
-"files.html":[2],
-"find__graph__symmetries_8h.html":[2,3],
-"find__graph__symmetries_8h_source.html":[2,3],
-"hungarian_8h.html":[2,4],
-"hungarian_8h.html#a9c61bb2d6de0894f19675e2110458877":[2,4,1],
-"hungarian_8h.html#ada8ccc36ef736b10ce389fbd347c4282":[2,4,0],
-"hungarian_8h_source.html":[2,4],
 "index.html":[],
-"knapsack__solver_8h.html":[2,5],
-"knapsack__solver_8h_source.html":[2,5],
-"pages.html":[],
-"sparse__permutation_8h.html":[2,6],
-"sparse__permutation_8h_source.html":[2,6]
+"pages.html":[]
 };
--- a/docs/cpp_algorithms/sparse__permutation_8h.html
+++ b/docs/cpp_algorithms/sparse__permutation_8h.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->
@@ -54,10 +50,7 @@ $(document).ready(function(){initNavTree('sparse__permutation_8h.html','');});
 <div class="title">sparse_permutation.h File Reference</div>  </div>
 </div><!--header-->
 <div class="contents">
-<div class="textblock"><code>#include &lt;string&gt;</code><br />
-<code>#include &lt;vector&gt;</code><br />
-<code>#include &quot;ortools/base/logging.h&quot;</code><br />
-</div>
+
 <p><a href="sparse__permutation_8h_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
--- a/docs/cpp_algorithms/sparse__permutation_8h_source.html
+++ b/docs/cpp_algorithms/sparse__permutation_8h_source.html
@@ -23,11 +23,7 @@
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
-    </ul>
-  </div>
-  <div id="navrow2" class="tabs2">
-    <ul class="tablist">
-      <li><a href="files.html"><span>File&#160;List</span></a></li>
+      <li class="current"><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
 </div><!-- top -->