always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update doc

Browse Source
This commit is contained in:
Mizux Seiha
2021-12-14 21:57:15 +01:00
parent f6b59dea7d
commit 2cb85b4eea
938 changed files with 26889 additions and 27600 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/cpp/shortestpaths_8h_source.html
View File

@@ -176,7 +176,7 @@ $(document).ready(function(){initNavTree('shortestpaths_8h_source.html',''); ini
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a18d2a8338b0d0e7ec3852cc0b58037ed"><div class="ttname"><a href="namespaceoperations__research.html#a18d2a8338b0d0e7ec3852cc0b58037ed">operations_research::DijkstraShortestPath</a></div><div class="ttdeci">bool DijkstraShortestPath(int node_count, int start_node, int end_node, std::function&lt; int64_t(int, int)&gt; graph, int64_t disconnected_distance, std::vector&lt; int &gt; *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00151">dijkstra.cc:151</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a40d226c5f5c250cf81ae0845a8afeb89"><div class="ttname"><a href="namespaceoperations__research.html#a40d226c5f5c250cf81ae0845a8afeb89">operations_research::AStarShortestPath</a></div><div class="ttdeci">bool AStarShortestPath(int node_count, int start_node, int end_node, std::function&lt; int64_t(int, int)&gt; graph, std::function&lt; int64_t(int)&gt; heuristic, int64_t disconnected_distance, std::vector&lt; int &gt; *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="astar_8cc_source.html#l00170">astar.cc:170</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a40d226c5f5c250cf81ae0845a8afeb89"><div class="ttname"><a href="namespaceoperations__research.html#a40d226c5f5c250cf81ae0845a8afeb89">operations_research::AStarShortestPath</a></div><div class="ttdeci">bool AStarShortestPath(int node_count, int start_node, int end_node, std::function&lt; int64_t(int, int)&gt; graph, std::function&lt; int64_t(int)&gt; heuristic, int64_t disconnected_distance, std::vector&lt; int &gt; *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="astar_8cc_source.html#l00169">astar.cc:169</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_a9e9e916a0fd3a846388cc235c42d99fb"><div class="ttname"><a href="namespaceoperations__research.html#a9e9e916a0fd3a846388cc235c42d99fb">operations_research::StableDijkstraShortestPath</a></div><div class="ttdeci">bool StableDijkstraShortestPath(int node_count, int start_node, int end_node, std::function&lt; int64_t(int, int)&gt; graph, int64_t disconnected_distance, std::vector&lt; int &gt; *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="dijkstra_8cc_source.html#l00160">dijkstra.cc:160</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html_ad7c912405ec283963f6a4f6dda80c674"><div class="ttname"><a href="namespaceoperations__research.html#ad7c912405ec283963f6a4f6dda80c674">operations_research::BellmanFordShortestPath</a></div><div class="ttdeci">bool BellmanFordShortestPath(int node_count, int start_node, int end_node, std::function&lt; int64_t(int, int)&gt; graph, int64_t disconnected_distance, std::vector&lt; int &gt; *nodes)</div><div class="ttdef"><b>Definition:</b> <a href="bellman__ford_8cc_source.html#l00115">bellman_ford.cc:115</a></div></div>
<div class="ttc" id="arouting__search_8cc_html_a6b7983ccd32c86cbbc3d4d9cda4cac17"><div class="ttname"><a href="routing__search_8cc.html#a6b7983ccd32c86cbbc3d4d9cda4cac17">nodes</a></div><div class="ttdeci">int nodes</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l03866">routing_search.cc:3866</a></div></div>