203 lines
12 KiB
HTML
203 lines
12 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.1</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.9.2 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('namespacemembers_func.html',''); initResizable(); });
|
|
/* @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="contents">
|
|
 
|
|
|
|
<h3><a id="index_a" name="index_a"></a>- a -</h3><ul>
|
|
<li>AddArcsFromMinimumSpanningTree() : <a class="el" href="namespaceoperations__research.html#af916b84aff43c128a27c2f02a55ab000">operations_research</a></li>
|
|
<li>AStarShortestPath() : <a class="el" href="namespaceoperations__research.html#a634910e6bc1101eb940ac9359c1cf675">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
|
|
<li>BeginEndRange() : <a class="el" href="namespaceutil.html#a30a4999be011343be06bd28753bf8ecc">util</a></li>
|
|
<li>BellmanFordShortestPath() : <a class="el" href="namespaceoperations__research.html#ac17f48e66614d1a9115e67d9c2d5f737">operations_research</a></li>
|
|
<li>BuildEulerianPath() : <a class="el" href="namespaceoperations__research.html#a1c554960a5c3ff8d8f9eacf5bf77377a">operations_research</a></li>
|
|
<li>BuildEulerianPathFromNode() : <a class="el" href="namespaceoperations__research.html#aea46f8caebe966fcd0739c713011693e">operations_research</a></li>
|
|
<li>BuildEulerianTour() : <a class="el" href="namespaceoperations__research.html#ad2edec3419b74442a91b597979950c5b">operations_research</a></li>
|
|
<li>BuildEulerianTourFromNode() : <a class="el" href="namespaceoperations__research.html#a5b4f8ac7471140527e6105ccc6e69c59">operations_research</a></li>
|
|
<li>BuildKruskalMinimumSpanningTree() : <a class="el" href="namespaceoperations__research.html#aea7ea9ecb4c13ebf26b36a576c4fdc5f">operations_research</a></li>
|
|
<li>BuildKruskalMinimumSpanningTreeFromSortedArcs() : <a class="el" href="namespaceoperations__research.html#aefd088882d7ba8d27157eba391b02792">operations_research</a></li>
|
|
<li>BuildLineGraph() : <a class="el" href="namespaceoperations__research.html#acb53c505b8fd29ceb3abdcc7dfd809ce">operations_research</a></li>
|
|
<li>BuildPrimMinimumSpanningTree() : <a class="el" href="namespaceoperations__research.html#aa7f6b276e52d86253d0798bc37f4994e">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_c" name="index_c"></a>- c -</h3><ul>
|
|
<li>ComputeMinimumWeightMatching() : <a class="el" href="namespaceoperations__research.html#acc1ef62538cd0faf409f9900fd6e2ae8">operations_research</a></li>
|
|
<li>ComputeMinimumWeightMatchingWithMIP() : <a class="el" href="namespaceoperations__research.html#a53bf12f941f978cc1b1b985816c1fbdf">operations_research</a></li>
|
|
<li>ComputeOnePossibleReverseArcMapping() : <a class="el" href="namespaceutil.html#a00a901881f9035f66a4204da4c0ea3e5">util</a></li>
|
|
<li>ComputeOneTree() : <a class="el" href="namespaceoperations__research.html#a9ef4076dcc63501e6d1ecf4a3c6da31b">operations_research</a></li>
|
|
<li>ComputeOneTreeLowerBound() : <a class="el" href="namespaceoperations__research.html#ae9af26e7687cb65967941eb175148fe5">operations_research</a></li>
|
|
<li>ComputeOneTreeLowerBoundWithAlgorithm() : <a class="el" href="namespaceoperations__research.html#a3ed3d609fa06ad508b3d21119f94a560">operations_research</a></li>
|
|
<li>ComputeOneTreeLowerBoundWithParameters() : <a class="el" href="namespaceoperations__research.html#a516a7ec8626d689aa84729fb6f358f89">operations_research</a></li>
|
|
<li>CopyGraph() : <a class="el" href="namespaceutil.html#ae5f98804c317dda817bff628d868c4dd">util</a></li>
|
|
<li>CoverArcsByCliques() : <a class="el" href="namespaceoperations__research.html#afe4b5a6c0e4019314f288e3f4307c114">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_d" name="index_d"></a>- d -</h3><ul>
|
|
<li>DEFINE_RANGE_BASED_ARC_ITERATION() : <a class="el" href="namespaceutil.html#a37be0131ae922e30a286797a0bef0c96">util</a></li>
|
|
<li>DijkstraShortestPath() : <a class="el" href="namespaceoperations__research.html#aad8df474bac5fb8fe87bedd18faf29a6">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
|
|
<li>EqualRange() : <a class="el" href="namespaceutil.html#a628255019800e5a053d08b1f0c5a05f2">util</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_f" name="index_f"></a>- f -</h3><ul>
|
|
<li>FindCliques() : <a class="el" href="namespaceoperations__research.html#a509097448ff5705cf3e64d889362bdec">operations_research</a></li>
|
|
<li>FlowModel_ProblemType_descriptor() : <a class="el" href="namespaceoperations__research.html#a20b4ffb71fd61bc4140c85a01bd29c20">operations_research</a></li>
|
|
<li>FlowModel_ProblemType_IsValid() : <a class="el" href="namespaceoperations__research.html#ac206da01730a9479e94e730343a14738">operations_research</a></li>
|
|
<li>FlowModel_ProblemType_Name() : <a class="el" href="namespaceoperations__research.html#ae6f6a6d5b8ff340509dee4e36a62ef65">operations_research</a></li>
|
|
<li>FlowModel_ProblemType_Parse() : <a class="el" href="namespaceoperations__research.html#ade67a7afb07d33044226a6fcc55238c9">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
|
|
<li>GetConnectedComponents() : <a class="el" href="namespaceutil.html#a366d433bd2afb387ea527c581447dffc">util</a></li>
|
|
<li>GetNodeMinimizingEdgeCostToSource() : <a class="el" href="namespaceoperations__research.html#aeae6cf89ac4d73d2e95cffaa0edbd687">operations_research</a></li>
|
|
<li>GetSubgraphOfNodes() : <a class="el" href="namespaceutil.html#a99094e047812eb44a7c2b3b82091f560">util</a></li>
|
|
<li>GetWeaklyConnectedComponents() : <a class="el" href="namespaceutil.html#a8a31111f9a74492f1de9238e463edd2a">util</a></li>
|
|
<li>GraphHasDuplicateArcs() : <a class="el" href="namespaceutil.html#a7cab01cf2313ef202fdb8d1540430c1c">util</a></li>
|
|
<li>GraphHasSelfArcs() : <a class="el" href="namespaceutil.html#a9aedc5b3920b0ce89959be43ece7625b">util</a></li>
|
|
<li>GraphIsSymmetric() : <a class="el" href="namespaceutil.html#aa94a02ae5c14feb50676668f2de166dc">util</a></li>
|
|
<li>GraphIsWeaklyConnected() : <a class="el" href="namespaceutil.html#ab66702bf387ec38027c1f94444872510">util</a></li>
|
|
<li>GraphToString() : <a class="el" href="namespaceutil.html#a372b5c94ec5d30f923449516ebc2a963">util</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_i" name="index_i"></a>- i -</h3><ul>
|
|
<li>IsEulerianGraph() : <a class="el" href="namespaceoperations__research.html#ab1cf773de0cae72d0c44efe5b8f4bb89">operations_research</a></li>
|
|
<li>IsSemiEulerianGraph() : <a class="el" href="namespaceoperations__research.html#a6b312dd19c90b2af099e6f159869f7ee">operations_research</a></li>
|
|
<li>IsSubsetOf0N() : <a class="el" href="namespaceutil.html#aa9fb4c9a176acaf72053b11727436e9e">util</a></li>
|
|
<li>IsValidPermutation() : <a class="el" href="namespaceutil.html#ad7986b01cf61a31c09a27b4a97db6a83">util</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
|
|
<li>MakeHamiltonianPathSolver() : <a class="el" href="namespaceoperations__research.html#ae3fee0d3bb89e4913ad2269f8a1be421">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_n" name="index_n"></a>- n -</h3><ul>
|
|
<li>NearestNeighbors() : <a class="el" href="namespaceoperations__research.html#ac5b08aa63fdd1b499b4653688c13af81">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
|
|
<li>PathHasCycle() : <a class="el" href="namespaceutil.html#a3215b610ebe65cde55008dc1367c434e">util</a></li>
|
|
<li>Permute() : <a class="el" href="namespaceutil.html#a8c227a057c1ce9d46b1185abf77ad91e">util</a></li>
|
|
<li>PermuteWithExplicitElementType() : <a class="el" href="namespaceutil.html#a9470623ca7db3c4a62ce3b326c6b07d8">util</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_r" name="index_r"></a>- r -</h3><ul>
|
|
<li>ReadGraphFile() : <a class="el" href="namespaceutil.html#ac1f20692bcd36ed6d01b970af9eb2972">util</a></li>
|
|
<li>RemapGraph() : <a class="el" href="namespaceutil.html#aab5724a929530fa1d28749dc82852388">util</a></li>
|
|
<li>RemoveCyclesFromPath() : <a class="el" href="namespaceutil.html#a77ac83968fcb358183853127d83d595a">util</a></li>
|
|
<li>RemoveSelfArcsAndDuplicateArcs() : <a class="el" href="namespaceutil.html#a95c44a2c444a459f0866bd5607537314">util</a></li>
|
|
<li>Reverse() : <a class="el" href="namespaceutil.html#a208121f27c615b309e2ab37bb85280f1">util</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_s" name="index_s"></a>- s -</h3><ul>
|
|
<li>StableDijkstraShortestPath() : <a class="el" href="namespaceoperations__research.html#af98f2130078a8bf53c590abd744cabfa">operations_research</a></li>
|
|
</ul>
|
|
|
|
|
|
<h3><a id="index_w" name="index_w"></a>- w -</h3><ul>
|
|
<li>WriteGraphToFile() : <a class="el" href="namespaceutil.html#a45fca0c4762006176ad5622ec40dea9c">util</a></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|