113 lines
37 KiB
HTML
113 lines
37 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"/>-->
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="banner-container">
|
|
<div id="banner">
|
|
<span id="sfml">Google OR-Tools 9.2</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.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('io_8h_source.html','');});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">io.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="io_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-2021 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">// A collections of i/o utilities for the Graph classes in ./graph.h.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#ifndef UTIL_GRAPH_IO_H_</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#define UTIL_GRAPH_IO_H_</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <numeric></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "absl/status/status.h"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "absl/status/statusor.h"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "absl/strings/numbers.h"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "absl/strings/str_split.h"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "ortools/base/filelineiter.h"</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="graph_8h.html">ortools/graph/graph.h</a>"</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="keyword">namespace </span><a class="code" href="namespaceutil.html">util</a> {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// Returns a string representation of a graph.</span></div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9"> 38</a></span> <span class="keyword">enum</span> <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9">GraphToStringFormat</a> {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <span class="comment">// One arc per line, eg. "3->1".</span></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9a59afa9bae775818b44690c5d14cdf8d0"> 40</a></span>  <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9a59afa9bae775818b44690c5d14cdf8d0">PRINT_GRAPH_ARCS</a>,</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// One space-separated adjacency list per line, eg. "3: 5 1 3 1".</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// Nodes with no outgoing arc get an empty list.</span></div><div class="line"><a name="l00044"></a><span class="lineno"><a class="line" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ac932364714f74e3ca75990c8126019a1"> 44</a></span>  <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ac932364714f74e3ca75990c8126019a1">PRINT_GRAPH_ADJACENCY_LISTS</a>,</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// Ditto, but the adjacency lists are sorted.</span></div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ada36744a3f529ceb03e7c1faa842854d"> 47</a></span>  <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ada36744a3f529ceb03e7c1faa842854d">PRINT_GRAPH_ADJACENCY_LISTS_SORTED</a>,</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> };</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="keyword">template</span> <<span class="keyword">class</span> Graph></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> std::string <a class="code" href="namespaceutil.html#a372b5c94ec5d30f923449516ebc2a963">GraphToString</a>(<span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>& graph, <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9">GraphToStringFormat</a> format);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Writes a graph to the ".g" file format described above. If "directed" is</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// true, all arcs are written to the file. If it is false, the graph is expected</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// to be undirected (i.e. the number of arcs a->b is equal to the number of arcs</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// b->a for all nodes a,b); and only the arcs a->b where a<=b are written. Note</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// however that in this case, the symmetry of the graph is not fully checked</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// (only the parity of the number of non-self arcs is).</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">//</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// "num_nodes_with_color" is optional. If it is not empty, then the color</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// information will be written to the header of the .g file. See ReadGraphFile.</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment">//</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// This method is the reverse of ReadGraphFile (with the same value for</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// "directed").</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="keyword">template</span> <<span class="keyword">class</span> Graph></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> absl::Status <a class="code" href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c">WriteGraphToFile</a>(<span class="keyword">const</span> <a class="code" href="namespaceutil.html#a2f76166dbe0c4055a1f256235ad00478">Graph</a>& graph, <span class="keyword">const</span> std::string& filename,</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordtype">bool</span> directed,</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keyword">const</span> std::vector<int>& num_nodes_with_color);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// Implementations of the templated methods.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">template</span> <<span class="keyword">class</span> Graph></div><div class="line"><a name="l00072"></a><span class="lineno"><a class="line" href="namespaceutil.html#a372b5c94ec5d30f923449516ebc2a963"> 72</a></span> std::string <a class="code" href="namespaceutil.html#a372b5c94ec5d30f923449516ebc2a963">GraphToString</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1_list_graph.html">Graph</a>& graph, <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9">GraphToStringFormat</a> format) {</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  std::string out;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  std::vector<typename Graph::NodeIndex> adj;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">Graph::NodeIndex</a> node : graph.<a class="code" href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">AllNodes</a>()) {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">if</span> (format == <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9a59afa9bae775818b44690c5d14cdf8d0">PRINT_GRAPH_ARCS</a>) {</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">Graph::ArcIndex</a> arc : graph.<a class="code" href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">OutgoingArcs</a>(node)) {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (!out.empty()) out += <span class="charliteral">'\n'</span>;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  absl::StrAppend(&out, node, <span class="stringliteral">"->"</span>, graph.<a class="code" href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(arc));</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  } <span class="keywordflow">else</span> { <span class="comment">// PRINT_GRAPH_ADJACENCY_LISTS[_SORTED]</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  adj.clear();</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">Graph::ArcIndex</a> arc : graph.<a class="code" href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">OutgoingArcs</a>(node)) {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  adj.push_back(graph.<a class="code" href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(arc));</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  }</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">if</span> (format == <a class="code" href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ada36744a3f529ceb03e7c1faa842854d">PRINT_GRAPH_ADJACENCY_LISTS_SORTED</a>) {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  std::sort(adj.begin(), adj.end());</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (node != 0) out += <span class="charliteral">'\n'</span>;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  absl::StrAppend(&out, node, <span class="stringliteral">": "</span>, absl::StrJoin(adj, <span class="stringliteral">" "</span>));</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  }</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> out;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">template</span> <<span class="keyword">class</span> Graph></div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c"> 97</a></span> absl::Status <a class="code" href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c">WriteGraphToFile</a>(<span class="keyword">const</span> <a class="code" href="classutil_1_1_list_graph.html">Graph</a>& graph, <span class="keyword">const</span> std::string& filename,</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordtype">bool</span> directed,</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">const</span> std::vector<int>& num_nodes_with_color) {</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  FILE* f = fopen(filename.c_str(), <span class="stringliteral">"w"</span>);</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (f == <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kInvalidArgument,</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="stringliteral">"Could not open file: '"</span> + filename + <span class="stringliteral">"'"</span>);</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  }</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// In undirected mode, we must count the self-arcs separately. All other arcs</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// should be duplicated.</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> num_self_arcs = 0;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">if</span> (!directed) {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">Graph::NodeIndex</a> node : graph.<a class="code" href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">AllNodes</a>()) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">Graph::ArcIndex</a> arc : graph.<a class="code" href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">OutgoingArcs</a>(node)) {</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">if</span> (graph.<a class="code" href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(arc) == node) ++num_self_arcs;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  }</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> ((graph.<a class="code" href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>() - num_self_arcs) % 2 != 0) {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  fclose(f);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kInvalidArgument,</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="stringliteral">"WriteGraphToFile() called with directed=false"</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="stringliteral">" and with a graph with an odd number of (non-self)"</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="stringliteral">" arcs!"</span>);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  absl::FPrintF(</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  f, <span class="stringliteral">"%d %d"</span>, static_cast<int64_t>(graph.<a class="code" href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>()),</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  static_cast<int64_t>(directed ? graph.<a class="code" href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>()</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  : (graph.<a class="code" href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">num_arcs</a>() + num_self_arcs) / 2));</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (!num_nodes_with_color.empty()) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (std::accumulate(num_nodes_with_color.begin(),</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  num_nodes_with_color.end(), 0) != graph.<a class="code" href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">num_nodes</a>() ||</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  *std::min_element(num_nodes_with_color.begin(),</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  num_nodes_with_color.end()) <= 0) {</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kInvalidArgument,</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="stringliteral">"WriteGraphToFile() called with invalid coloring."</span>);</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  absl::FPrintF(f, <span class="stringliteral">" %d"</span>, num_nodes_with_color.size());</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_nodes_with_color.size() - 1; ++i) {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  absl::FPrintF(f, <span class="stringliteral">" %d"</span>, static_cast<int64_t>(num_nodes_with_color[i]));</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  absl::FPrintF(f, <span class="stringliteral">"\n"</span>);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span> </div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">Graph::NodeIndex</a> node : graph.<a class="code" href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">AllNodes</a>()) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">Graph::ArcIndex</a> arc : graph.<a class="code" href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">OutgoingArcs</a>(node)) {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">Graph::NodeIndex</a> head = graph.<a class="code" href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">Head</a>(arc);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordflow">if</span> (directed || head >= node) {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  absl::FPrintF(f, <span class="stringliteral">"%d %d\n"</span>, static_cast<int64_t>(node),</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  static_cast<uint64_t>(head));</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (fclose(f) != 0) {</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">return</span> absl::Status(absl::StatusCode::kInternal,</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="stringliteral">"Could not close file '"</span> + filename + <span class="stringliteral">"'"</span>);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  return ::absl::OkStatus();</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> }</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span> } <span class="comment">// namespace util</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="preprocessor">#endif // UTIL_GRAPH_IO_H_</span></div><div class="ttc" id="classutil_1_1_list_graph_html_ad7db584fc1fe14ce9296131fda625994"><div class="ttname"><a href="classutil_1_1_list_graph.html#ad7db584fc1fe14ce9296131fda625994">util::ListGraph::OutgoingArcs</a></div><div class="ttdeci">BeginEndWrapper< OutgoingArcIterator > OutgoingArcs(NodeIndexType node) const</div></div>
|
|
<div class="ttc" id="namespaceutil_html_a2d1e9c029dfaa2e8dfd58862836440b9ac932364714f74e3ca75990c8126019a1"><div class="ttname"><a href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ac932364714f74e3ca75990c8126019a1">util::PRINT_GRAPH_ADJACENCY_LISTS</a></div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00044">io.h:44</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_list_graph_html_aceb0938bcb2e8e5f37986d4cf8e3a955"><div class="ttname"><a href="classutil_1_1_list_graph.html#aceb0938bcb2e8e5f37986d4cf8e3a955">util::ListGraph::Head</a></div><div class="ttdeci">NodeIndexType Head(ArcIndexType arc) const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l01119">graph.h:1119</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html"><div class="ttname"><a href="namespaceutil.html">util</a></div><div class="ttdef"><b>Definition:</b> <a href="connected__components_8h_source.html#l00056">connected_components.h:56</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_base_graph_html_a4d3fc55a2fe209a908470199437cec9a"><div class="ttname"><a href="classutil_1_1_base_graph.html#a4d3fc55a2fe209a908470199437cec9a">util::BaseGraph::num_arcs</a></div><div class="ttdeci">ArcIndexType num_arcs() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00207">graph.h:207</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a2d1e9c029dfaa2e8dfd58862836440b9ada36744a3f529ceb03e7c1faa842854d"><div class="ttname"><a href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9ada36744a3f529ceb03e7c1faa842854d">util::PRINT_GRAPH_ADJACENCY_LISTS_SORTED</a></div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00047">io.h:47</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_list_graph_html"><div class="ttname"><a href="classutil_1_1_list_graph.html">util::ListGraph</a></div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00300">graph.h:300</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a372b5c94ec5d30f923449516ebc2a963"><div class="ttname"><a href="namespaceutil.html#a372b5c94ec5d30f923449516ebc2a963">util::GraphToString</a></div><div class="ttdeci">std::string GraphToString(const Graph &graph, GraphToStringFormat format)</div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00072">io.h:72</a></div></div>
|
|
<div class="ttc" id="namespaceutil_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#l02362">graph.h:2362</a></div></div>
|
|
<div class="ttc" id="graph_8h_html"><div class="ttname"><a href="graph_8h.html">graph.h</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_base_graph_html_a8a40f2c75615a26ba71e94dd7d42f481"><div class="ttname"><a href="classutil_1_1_base_graph.html#a8a40f2c75615a26ba71e94dd7d42f481">util::BaseGraph::AllNodes</a></div><div class="ttdeci">IntegerRange< NodeIndex > AllNodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00937">graph.h:937</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a45fca0c4762006176ad5622ec40dea9c"><div class="ttname"><a href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c">util::WriteGraphToFile</a></div><div class="ttdeci">absl::Status WriteGraphToFile(const Graph &graph, const std::string &filename, bool directed, const std::vector< int > &num_nodes_with_color)</div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00097">io.h:97</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_base_graph_html_a6a2df5042167b234f6dc3aed4acfa6c9"><div class="ttname"><a href="classutil_1_1_base_graph.html#a6a2df5042167b234f6dc3aed4acfa6c9">util::BaseGraph::num_nodes</a></div><div class="ttdeci">NodeIndexType num_nodes() const</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00204">graph.h:204</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a2d1e9c029dfaa2e8dfd58862836440b9a59afa9bae775818b44690c5d14cdf8d0"><div class="ttname"><a href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9a59afa9bae775818b44690c5d14cdf8d0">util::PRINT_GRAPH_ARCS</a></div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00040">io.h:40</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_base_graph_html_aec05ff3d270a5f888e1623c2a99ff2aa"><div class="ttname"><a href="classutil_1_1_base_graph.html#aec05ff3d270a5f888e1623c2a99ff2aa">util::BaseGraph< NodeIndexType, ArcIndexType, false >::NodeIndex</a></div><div class="ttdeci">NodeIndexType NodeIndex</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00192">graph.h:192</a></div></div>
|
|
<div class="ttc" id="classutil_1_1_base_graph_html_a92531459eff09455cfa63976f5024906"><div class="ttname"><a href="classutil_1_1_base_graph.html#a92531459eff09455cfa63976f5024906">util::BaseGraph< NodeIndexType, ArcIndexType, false >::ArcIndex</a></div><div class="ttdeci">ArcIndexType ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="graph_8h_source.html#l00193">graph.h:193</a></div></div>
|
|
<div class="ttc" id="namespaceutil_html_a2d1e9c029dfaa2e8dfd58862836440b9"><div class="ttname"><a href="namespaceutil.html#a2d1e9c029dfaa2e8dfd58862836440b9">util::GraphToStringFormat</a></div><div class="ttdeci">GraphToStringFormat</div><div class="ttdef"><b>Definition:</b> <a href="io_8h_source.html#l00038">io.h:38</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|