135 lines
12 KiB
HTML
135 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('functions_func_c.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_c" name="index_c"></a>- c -</h3><ul>
|
|
<li>capacity() : <a class="el" href="classoperations__research_1_1_arc.html#a8274f036ea50c0f984d9a0a1760ecff5">Arc</a></li>
|
|
<li>Capacity() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a9dcd8610149406a1593d2a0725290482">GenericMaxFlow< Graph ></a>, <a class="el" href="classoperations__research_1_1_generic_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType ></a>, <a class="el" href="classoperations__research_1_1_simple_max_flow.html#a9dcd8610149406a1593d2a0725290482">SimpleMaxFlow</a>, <a class="el" href="classoperations__research_1_1_simple_min_cost_flow.html#a9dcd8610149406a1593d2a0725290482">SimpleMinCostFlow</a></li>
|
|
<li>capacity() : <a class="el" href="classutil_1_1_s_vector.html#ad14f726e7d9d1e7c71a6b1c652bb2c19">SVector< T ></a></li>
|
|
<li>Cardinality() : <a class="el" href="classoperations__research_1_1_set.html#a879ebf910431019a01f98d0865749c8d">Set< Integer ></a></li>
|
|
<li>ChangeCostMatrix() : <a class="el" href="classoperations__research_1_1_hamiltonian_path_solver.html#a19edb994fca04e71736cf3a8d62d7a73">HamiltonianPathSolver< CostType, CostFunction ></a></li>
|
|
<li>CheckArcBounds() : <a class="el" href="classoperations__research_1_1_ebert_graph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">EbertGraph< NodeIndexType, ArcIndexType ></a>, <a class="el" href="classoperations__research_1_1_forward_ebert_graph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">ForwardEbertGraph< NodeIndexType, ArcIndexType ></a>, <a class="el" href="classoperations__research_1_1_forward_static_graph.html#ac6532804a8bcf9ca89e41b0e3139d5fb">ForwardStaticGraph< NodeIndexType, ArcIndexType ></a></li>
|
|
<li>CheckArcValidity() : <a class="el" href="classoperations__research_1_1_ebert_graph.html#a553e5eeb2887a1d7663e1200b7466e6c">EbertGraph< NodeIndexType, ArcIndexType ></a>, <a class="el" href="classoperations__research_1_1_forward_ebert_graph.html#a553e5eeb2887a1d7663e1200b7466e6c">ForwardEbertGraph< NodeIndexType, ArcIndexType ></a>, <a class="el" href="classoperations__research_1_1_forward_static_graph.html#a553e5eeb2887a1d7663e1200b7466e6c">ForwardStaticGraph< NodeIndexType, ArcIndexType ></a></li>
|
|
<li>CheckFeasibility() : <a class="el" href="classoperations__research_1_1_generic_min_cost_flow.html#a92607deae80e69a2a63cc2d8f5205bd5">GenericMinCostFlow< Graph, ArcFlowType, ArcScaledCostType ></a></li>
|
|
<li>CheckInputConsistency() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a12ffc143b8d66de80c07572cc8509037">GenericMaxFlow< Graph ></a></li>
|
|
<li>CheckRelabelPrecondition() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a2a555ba2dc0a468e6fee4a0665b12272">GenericMaxFlow< Graph ></a></li>
|
|
<li>CheckResult() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#aac87a51b41d88b6976a12007bae9b91d">GenericMaxFlow< Graph ></a></li>
|
|
<li>CheckTailIndexValidity() : <a class="el" href="classoperations__research_1_1_forward_ebert_graph.html#a6832ebe70da89cb9d2efea26a823d204">ForwardEbertGraph< NodeIndexType, ArcIndexType ></a>, <a class="el" href="classoperations__research_1_1_forward_static_graph.html#a6832ebe70da89cb9d2efea26a823d204">ForwardStaticGraph< NodeIndexType, ArcIndexType ></a></li>
|
|
<li>ChristofidesPathSolver() : <a class="el" href="classoperations__research_1_1_christofides_path_solver.html#a87145cf1f5a36d27fd856596a23d495a">ChristofidesPathSolver< CostType, ArcIndex, NodeIndex, CostFunction ></a></li>
|
|
<li>Clear() : <a class="el" href="classoperations__research_1_1_arc.html#a1e436b607da362266ed7e00d18cd6ac7">Arc</a>, <a class="el" href="classoperations__research_1_1_flow_model.html#a1e436b607da362266ed7e00d18cd6ac7">FlowModel</a>, <a class="el" href="classoperations__research_1_1_node.html#a1e436b607da362266ed7e00d18cd6ac7">Node</a>, <a class="el" href="classoperations__research_1_1_priority_queue_with_restricted_push.html#aa71d36872f416feaa853788a7a7a7ef8">PriorityQueueWithRestrictedPush< Element, IntegerPriority ></a></li>
|
|
<li>clear() : <a class="el" href="classutil_1_1_s_vector.html#ac8bb3912a3ce86b15842e79d0b421204">SVector< T ></a></li>
|
|
<li>clear_and_dealloc() : <a class="el" href="classutil_1_1_s_vector.html#a631f9ba7174b41f44c98433a026e2f7a">SVector< T ></a></li>
|
|
<li>clear_arc() : <a class="el" href="classoperations__research_1_1_flow_model.html#adf06045109f23e89b21772e682da4399">FlowModel</a></li>
|
|
<li>clear_capacity() : <a class="el" href="classoperations__research_1_1_arc.html#a5f7eed65007d1ae5558b58c478f69f12">Arc</a></li>
|
|
<li>clear_head_node_id() : <a class="el" href="classoperations__research_1_1_arc.html#a81387c5828ec8b801227f53eb5ec1781">Arc</a></li>
|
|
<li>clear_id() : <a class="el" href="classoperations__research_1_1_node.html#a6367f7e976e1ce24ff52cf2958a3bbda">Node</a></li>
|
|
<li>clear_node() : <a class="el" href="classoperations__research_1_1_flow_model.html#aed5c697a4ea9159c511459bcaa1cc8e8">FlowModel</a></li>
|
|
<li>clear_problem_type() : <a class="el" href="classoperations__research_1_1_flow_model.html#a8a1e1d7652b7b8c1c70fb17eaf55f913">FlowModel</a></li>
|
|
<li>clear_supply() : <a class="el" href="classoperations__research_1_1_node.html#a7b40af5e8ad8689f4f69a225e2473c67">Node</a></li>
|
|
<li>clear_tail_node_id() : <a class="el" href="classoperations__research_1_1_arc.html#ac9fac3af49c8c8f82118fe906c54fe5f">Arc</a></li>
|
|
<li>clear_unit_cost() : <a class="el" href="classoperations__research_1_1_arc.html#a606ad4d0fbe863ea6feafbbc1ae92bd4">Arc</a></li>
|
|
<li>CompleteBipartiteGraph() : <a class="el" href="classutil_1_1_complete_bipartite_graph.html#a98b1112f3c64c1c28699c93b952ebf4e">CompleteBipartiteGraph< NodeIndexType, ArcIndexType ></a></li>
|
|
<li>CompleteGraph() : <a class="el" href="classutil_1_1_complete_graph.html#a3d64d2842e97ec8cd6d6e95208ead70f">CompleteGraph< NodeIndexType, ArcIndexType ></a></li>
|
|
<li>ComputeAssignment() : <a class="el" href="classoperations__research_1_1_linear_sum_assignment.html#a63b3d12e721188086870cc42cc46a258">LinearSumAssignment< GraphType ></a></li>
|
|
<li>ComputeCumulativeSum() : <a class="el" href="classutil_1_1_base_graph.html#aacbf67d9ee658147495316e1ac2c83f2">BaseGraph< NodeIndexType, ArcIndexType, HasReverseArcs ></a></li>
|
|
<li>ComputeReachableNodes() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#ac0290c8f8892c50d7b29e9770fda4923">GenericMaxFlow< Graph ></a></li>
|
|
<li>Connected() : <a class="el" href="class_connected_components_finder.html#ac7782f36c09257f370347166e02480f1">ConnectedComponentsFinder< T, CompareOrHashT ></a>, <a class="el" href="class_dense_connected_components_finder.html#a962b54327591b21cc0a9273f78906a8b">DenseConnectedComponentsFinder</a></li>
|
|
<li>ConnectedComponentsFinder() : <a class="el" href="class_connected_components_finder.html#a9d3b69f74c9aa5e8ddbf4e4056320a66">ConnectedComponentsFinder< T, CompareOrHashT ></a></li>
|
|
<li>Contains() : <a class="el" href="classoperations__research_1_1_set.html#a0faec65dbf29460ec59dfa75d0536efb">Set< Integer ></a></li>
|
|
<li>CopyFrom() : <a class="el" href="classoperations__research_1_1_arc.html#a53512c3ead99a8ae676152ae576c76df">Arc</a>, <a class="el" href="classoperations__research_1_1_flow_model.html#a96fc6023180f6453b7f18000aa837552">FlowModel</a>, <a class="el" href="classoperations__research_1_1_node.html#aa76c9620775a54fc71a1b839548a47bf">Node</a></li>
|
|
<li>CostValueCycleHandler() : <a class="el" href="classoperations__research_1_1_cost_value_cycle_handler.html#a8bd36eabd11be9f5c4e3094418412544">CostValueCycleHandler< ArcIndexType ></a></li>
|
|
<li>CreateFlowModel() : <a class="el" href="classoperations__research_1_1_generic_max_flow.html#afbd2be8210b3c04ac5ee3a879f1e62de">GenericMaxFlow< Graph ></a></li>
|
|
<li>CreateFlowModelOfLastSolve() : <a class="el" href="classoperations__research_1_1_simple_max_flow.html#a4d39b4f2db0792ccce2a922c74f43ecf">SimpleMaxFlow</a></li>
|
|
<li>CycleHandlerForAnnotatedArcs() : <a class="el" href="classoperations__research_1_1_ebert_graph_base_1_1_cycle_handler_for_annotated_arcs.html#a98dbfe5b691e0943198565a525d17886">EbertGraphBase< NodeIndexType, ArcIndexType, DerivedGraph >::CycleHandlerForAnnotatedArcs</a>, <a class="el" href="classoperations__research_1_1_forward_static_graph_1_1_cycle_handler_for_annotated_arcs.html#a3764aae97c7333c95ea9f99a176e98df">ForwardStaticGraph< NodeIndexType, ArcIndexType >::CycleHandlerForAnnotatedArcs</a></li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|