162 lines
7.7 KiB
HTML
162 lines
7.7 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 8.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.8.20 -->
|
|
<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('functions_p.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">
|
|
<div class="textblock">Here is a list of all class members with links to the classes they belong to:</div>
|
|
|
|
<h3><a id="index_p"></a>- p -</h3><ul>
|
|
<li>PermutationIndexComparisonByArcHead()
|
|
: <a class="el" href="classoperations__research_1_1_permutation_index_comparison_by_arc_head.html#aaf93c351ba18edcfcc2949a6c31fc9b1">PermutationIndexComparisonByArcHead< NodeIndexType, ArcIndexType ></a>
|
|
</li>
|
|
<li>pointer
|
|
: <a class="el" href="classutil_1_1_list_graph_1_1_outgoing_head_iterator.html#a50d582aa47b8770809f0828f8287d590">ListGraph< NodeIndexType, ArcIndexType >::OutgoingHeadIterator</a>
|
|
</li>
|
|
<li>Pop()
|
|
: <a class="el" href="classoperations__research_1_1_priority_queue_with_restricted_push.html#af355586ee86be2298efe2e81367eeffe">PriorityQueueWithRestrictedPush< Element, IntegerPriority ></a>
|
|
</li>
|
|
<li>POSSIBLE_OVERFLOW
|
|
: <a class="el" href="classoperations__research_1_1_simple_max_flow.html#a67a0db04d321a74b7e7fcfd3f1a3f70ba63e6c2750d99f3c548e6a08bb6822fe2">SimpleMaxFlow</a>
|
|
</li>
|
|
<li>PriorityQueueWithRestrictedPush()
|
|
: <a class="el" href="classoperations__research_1_1_priority_queue_with_restricted_push.html#a3b2c821405c1875d5f8975e1ceae6a60">PriorityQueueWithRestrictedPush< Element, IntegerPriority ></a>
|
|
</li>
|
|
<li>problem_type()
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a8b2e4c5099f8bd3ab58f829876f7b43a">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a8ed761696b491f3528169c36ee2eff3c">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_ARRAYSIZE
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a78c247d476f4d6b37dc920ee286953e6">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_descriptor()
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a7a3b8efd45171f109a544cfe792aed41">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_IsValid()
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#af35bf80efe6fa8fd7c492d4bff2c52c5">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_MAX
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#aaccfa0d271467eead8e23e1ae0915b6d">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_MIN
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a66ce74386fd760ac35a2f5b2ca40918d">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_Name()
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#ac024461aac3641aa5b6d107d86657d42">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>ProblemType_Parse()
|
|
: <a class="el" href="classoperations__research_1_1_p_r_o_t_o_b_u_f___f_i_n_a_l.html#a8ac2dda8b2c5319e98736e1af00557e7">PROTOBUF_FINAL</a>
|
|
</li>
|
|
<li>process_node_by_height_
|
|
: <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a33996084cb5b29f77cc6ee673b6ece51">GenericMaxFlow< Graph ></a>
|
|
</li>
|
|
<li>ProcessNodeByHeight()
|
|
: <a class="el" href="classoperations__research_1_1_generic_max_flow.html#ae93d8aa8c02df69fd88f9cdd1463bae3">GenericMaxFlow< Graph ></a>
|
|
</li>
|
|
<li>PROTOBUF_SECTION_VARIABLE()
|
|
: <a class="el" href="struct_table_struct__ortools__2fgraph__2fflow__5fproblem__2eproto.html#a662054e6fa26895882c36ee1a37a629e">TableStruct_ortools_2fgraph_2fflow_5fproblem_2eproto</a>
|
|
</li>
|
|
<li>PruningHamiltonianSolver()
|
|
: <a class="el" href="classoperations__research_1_1_pruning_hamiltonian_solver.html#a4772bfe5f78a696373e531ba983bc695">PruningHamiltonianSolver< CostType, CostFunction ></a>
|
|
</li>
|
|
<li>Push()
|
|
: <a class="el" href="classoperations__research_1_1_priority_queue_with_restricted_push.html#a83681186fdc5615ec1185ad4075e1023">PriorityQueueWithRestrictedPush< Element, IntegerPriority ></a>
|
|
</li>
|
|
<li>PushActiveNode()
|
|
: <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a420abfd079f041eac775859ab19e644d">GenericMaxFlow< Graph ></a>
|
|
</li>
|
|
<li>PushFlow()
|
|
: <a class="el" href="classoperations__research_1_1_generic_max_flow.html#abedc5621560431c2527859bd5d1ab8fc">GenericMaxFlow< Graph ></a>
|
|
</li>
|
|
<li>PushFlowExcessBackToSource()
|
|
: <a class="el" href="classoperations__research_1_1_generic_max_flow.html#a3a4afd902c22768de7955ba9983fb282">GenericMaxFlow< Graph ></a>
|
|
</li>
|
|
</ul>
|
|
</div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div>
|
|
</div>
|
|
<div id="footer-container">
|
|
<div id="footer">
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|