mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-30 16:51:57 +08:00
Documentation for c8ce6f404c
This commit is contained in:
github-actions
660
d7/d07/bidirectional__dijkstra_8cpp.html
Normal file
660
d7/d07/bidirectional__dijkstra_8cpp.html
Normal file
@@ -0,0 +1,660 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.20"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: graph/bidirectional_dijkstra.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- 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('d7/d07/bidirectional__dijkstra_8cpp.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="header">
|
||||
<div class="summary">
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> |
|
||||
<a href="#var-members">Variables</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">bidirectional_dijkstra.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p><a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">Bidirectional Dijkstra Shortest Path Algorithm</a>
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <limits></code><br />
|
||||
<code>#include <queue></code><br />
|
||||
<code>#include <utility></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for bidirectional_dijkstra.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df6/bidirectional__dijkstra_8cpp__incl.svg" width="494" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d4/d13/namespacebidirectional__dijkstra"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></td></tr>
|
||||
<tr class="memdesc:d4/d13/namespacebidirectional__dijkstra"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">Bidirectional Dijkstra Shortest Path</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a6f92fe022b7e5d453f7257d763b6f3e2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
|
||||
<tr class="memdesc:a6f92fe022b7e5d453f7257d763b6f3e2"><td class="mdescLeft"> </td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">More...</a><br /></td></tr>
|
||||
<tr class="separator:a6f92fe022b7e5d453f7257d763b6f3e2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab322409d0015c023d91c67b5b2679257"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">graph::bidirectional_dijkstra::Shortest_Path_Distance</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > &workset_, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t >> &distance_)</td></tr>
|
||||
<tr class="memdesc:ab322409d0015c023d91c67b5b2679257"><td class="mdescLeft"> </td><td class="mdescRight">This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'. <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">More...</a><br /></td></tr>
|
||||
<tr class="separator:ab322409d0015c023d91c67b5b2679257"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa3848a7213562b47084585499d3642a5"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5">graph::bidirectional_dijkstra::Bidijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> *adj2, uint64_t s, uint64_t t)</td></tr>
|
||||
<tr class="memdesc:aa3848a7213562b47084585499d3642a5"><td class="mdescLeft"> </td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source. <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa3848a7213562b47084585499d3642a5"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Function to test the provided algorithm above. <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">More...</a><br /></td></tr>
|
||||
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
|
||||
Variables</h2></td></tr>
|
||||
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a><int64_t>::max()</td></tr>
|
||||
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft"> </td><td class="mdescRight">for store the graph, the distances, and the path <a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">More...</a><br /></td></tr>
|
||||
<tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">Bidirectional Dijkstra Shortest Path Algorithm</a> </p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="http://github.com/Marinovsky">Marinovksy</a></dd></dl>
|
||||
<p>This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: <a href="https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s">https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s</a> </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a6f92fe022b7e5d453f7257d763b6f3e2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a6f92fe022b7e5d453f7257d763b6f3e2">◆ </a></span>addEdge()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void graph::bidirectional_dijkstra::addEdge </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> * </td>
|
||||
<td class="paramname"><em>adj1</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> * </td>
|
||||
<td class="paramname"><em>adj2</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">uint64_t </td>
|
||||
<td class="paramname"><em>u</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">uint64_t </td>
|
||||
<td class="paramname"><em>v</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">uint64_t </td>
|
||||
<td class="paramname"><em>w</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Function that add edge between two nodes or vertices of graph. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">adj1</td><td>adjacency list for the direct search </td></tr>
|
||||
<tr><td class="paramname">adj2</td><td>adjacency list for the reverse search </td></tr>
|
||||
<tr><td class="paramname">u</td><td>any node or vertex of graph </td></tr>
|
||||
<tr><td class="paramname">v</td><td>any node or vertex of graph </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  {</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  (*adj1)[u - 1].push_back(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(v - 1, w));</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  (*adj2)[v - 1].push_back(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(u - 1, w));</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_a6f92fe022b7e5d453f7257d763b6f3e2_cgraph.svg" width="298" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="aa3848a7213562b47084585499d3642a5"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa3848a7213562b47084585499d3642a5">◆ </a></span>Bidijkstra()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int graph::bidirectional_dijkstra::Bidijkstra </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> * </td>
|
||||
<td class="paramname"><em>adj1</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>< uint64_t, uint64_t >>> * </td>
|
||||
<td class="paramname"><em>adj2</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">uint64_t </td>
|
||||
<td class="paramname"><em>s</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">uint64_t </td>
|
||||
<td class="paramname"><em>t</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">adj1</td><td>input graph </td></tr>
|
||||
<tr><td class="paramname">adj2</td><td>input graph reversed </td></tr>
|
||||
<tr><td class="paramname">s</td><td>source vertex </td></tr>
|
||||
<tr><td class="paramname">t</td><td>target vertex</td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>shortest distance if target is reachable from source else -1 in case if target is not reachable from source. </dd></dl>
|
||||
<p>n denotes the number of vertices in graph</p>
|
||||
<p>setting all the distances initially to INF</p>
|
||||
<p>creating a a vector of min heap using priority queue pq[0] contains the min heap for the direct search pq[1] contains the min heap for the reverse search</p>
|
||||
<p>first element of pair contains the distance second element of pair contains the vertex</p>
|
||||
<p>vector for store the nodes or vertices in the shortest path</p>
|
||||
<p>vector for store the nodes or vertices visited</p>
|
||||
<p>pushing the source vertex 's' with 0 distance in pq[0] min heap</p>
|
||||
<p>marking the distance of source as 0</p>
|
||||
<p>pushing the target vertex 't' with 0 distance in pq[1] min heap</p>
|
||||
<p>marking the distance of target as 0</p>
|
||||
<p>direct search</p>
|
||||
<p>second element of pair denotes the node / vertex</p>
|
||||
<p>first element of pair denotes the distance</p>
|
||||
<p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
|
||||
<p>minimizing distances</p>
|
||||
<p>check if currentNode has already been visited</p>
|
||||
<p>reversed search</p>
|
||||
<p>second element of pair denotes the node / vertex</p>
|
||||
<p>first element of pair denotes the distance</p>
|
||||
<p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
|
||||
<p>minimizing distances</p>
|
||||
<p>check if currentNode has already been visited</p>
|
||||
<div class="fragment"><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> /// n denotes the number of vertices in graph</span></div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"></span> uint64_t n = adj1-><a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> /// setting all the distances initially to INF</span></div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint64_t></a>> dist(2, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a>(n, <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>));</div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="comment"> /// creating a a vector of min heap using priority queue</span></div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"> /// pq[0] contains the min heap for the direct search</span></div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> /// pq[1] contains the min heap for the reverse search</span></div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"></span><span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="comment"> /// first element of pair contains the distance</span></div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> <span class="comment"> /// second element of pair contains the vertex</span></div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue<std::pair<uint64_t, uint64_t></a>,</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::pair<uint64_t, uint64_t></a>>,</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater<std::pair<uint64_t, uint64_t></a>>>></div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  pq(2);<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"> /// vector for store the nodes or vertices in the shortest path</span></div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> workset(n);<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="comment"> /// vector for store the nodes or vertices visited</span></div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> visited(n);</div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span> <span class="comment"> /// pushing the source vertex 's' with 0 distance in pq[0] min heap</span></div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="comment"></span> pq[0].push(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, s));</div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <span class="comment"> /// marking the distance of source as 0</span></div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span> <span class="comment"></span> dist[0][s] = 0;</div>
|
||||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> /// pushing the target vertex 't' with 0 distance in pq[1] min heap</span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"></span> pq[1].push(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, t));</div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span> <span class="comment"> /// marking the distance of target as 0</span></div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> <span class="comment"></span> dist[1][t] = 0;</div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  </div>
|
||||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> /// direct search</span></div>
|
||||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// If pq[0].size() is equal to zero then the node/ vertex is not</span></div>
|
||||
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// reachable from s</span></div>
|
||||
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">if</span> (pq[0].size() == 0) {</div>
|
||||
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"> /// second element of pair denotes the node / vertex</span></div>
|
||||
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment"></span> uint64_t currentNode = pq[0].top().second;</div>
|
||||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> /// first element of pair denotes the distance</span></div>
|
||||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"></span> uint64_t currentDist = pq[0].top().first;</div>
|
||||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
||||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  pq[0].pop();</div>
|
||||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"> /// for all the reachable vertex from the currently exploring vertex</span></div>
|
||||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span> <span class="comment"> /// we will try to minimize the distance</span></div>
|
||||
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"></span> <span class="keywordflow">for</span> (<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<int, int></a> edge : (*adj1)[currentNode]) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> /// minimizing distances</span></div>
|
||||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"></span> <span class="keywordflow">if</span> (currentDist + edge.second < dist[0][edge.first]) {</div>
|
||||
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  dist[0][edge.first] = currentDist + edge.second;</div>
|
||||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  pq[0].push(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[0][edge.first], edge.first));</div>
|
||||
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</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>  <span class="comment">// store the processed node/ vertex</span></div>
|
||||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  workset.push_back(currentNode);</div>
|
||||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="comment"> /// check if currentNode has already been visited</span></div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="comment"></span> <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">return</span> <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">Shortest_Path_Distance</a>(workset, dist);</div>
|
||||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  }</div>
|
||||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  visited[currentNode] = <span class="keyword">true</span>;<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment"> /// reversed search</span></div>
|
||||
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// If pq[1].size() is equal to zero then the node/ vertex is not</span></div>
|
||||
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">// reachable from t</span></div>
|
||||
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordflow">if</span> (pq[1].size() == 0) {</div>
|
||||
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="comment"> /// second element of pair denotes the node / vertex</span></div>
|
||||
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="comment"></span> currentNode = pq[1].top().second;</div>
|
||||
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="comment"> /// first element of pair denotes the distance</span></div>
|
||||
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="comment"></span> currentDist = pq[1].top().first;</div>
|
||||
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
||||
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  pq[1].pop();</div>
|
||||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> /// for all the reachable vertex from the currently exploring vertex</span></div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> /// we will try to minimize the distance</span></div>
|
||||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"></span> <span class="keywordflow">for</span> (<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<int, int></a> edge : (*adj2)[currentNode]) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="comment"> /// minimizing distances</span></div>
|
||||
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="comment"></span> <span class="keywordflow">if</span> (currentDist + edge.second < dist[1][edge.first]) {</div>
|
||||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  dist[1][edge.first] = currentDist + edge.second;</div>
|
||||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  pq[1].push(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[1][edge.first], edge.first));</div>
|
||||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div>
|
||||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div>
|
||||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// store the processed node/ vertex</span></div>
|
||||
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  workset.push_back(currentNode);</div>
|
||||
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> /// check if currentNode has already been visited</span></div>
|
||||
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"></span> <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
|
||||
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">return</span> <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">Shortest_Path_Distance</a>(workset, dist);</div>
|
||||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  }</div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  visited[currentNode] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_aa3848a7213562b47084585499d3642a5_cgraph.svg" width="300" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">void </td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  {</div>
|
||||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// running predefined tests</span></div>
|
||||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  uint64_t vertices = uint64_t();</div>
|
||||
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  uint64_t edges = uint64_t();</div>
|
||||
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the number of vertices : "</span>;</div>
|
||||
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> vertices;</div>
|
||||
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the number of edges : "</span>;</div>
|
||||
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> edges;</div>
|
||||
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
||||
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj1(</div>
|
||||
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  vertices, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj2(</div>
|
||||
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  vertices, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div>
|
||||
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  uint64_t u = uint64_t(), v = uint64_t(), w = uint64_t();</div>
|
||||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the edges by three integers in this form: u v w "</span></div>
|
||||
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Example: if there is and edge between node 1 and node 4 with "</span></div>
|
||||
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="stringliteral">"weight 7 enter: 1 4 7, and then press enter"</span></div>
|
||||
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">while</span> (edges--) {</div>
|
||||
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> u >> v >> w;</div>
|
||||
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj1, &adj2, u, v, w);</div>
|
||||
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (edges != 0) {</div>
|
||||
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter the next edge"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div>
|
||||
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  }</div>
|
||||
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  </div>
|
||||
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  uint64_t s = uint64_t(), t = uint64_t();</div>
|
||||
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
|
||||
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  << <span class="stringliteral">"Enter the source node and the target node separated by a space"</span></div>
|
||||
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Example: If the source node is 5 and the target node is 6 "</span></div>
|
||||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="stringliteral">"enter: 5 6 and press enter"</span></div>
|
||||
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> s >> t;</div>
|
||||
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordtype">int</span> dist =</div>
|
||||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5">graph::bidirectional_dijkstra::Bidijkstra</a>(&adj1, &adj2, s - 1, t - 1);</div>
|
||||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (dist == -1) {</div>
|
||||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Target not reachable from source"</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Shortest Path Distance : "</span> << dist << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
||||
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  </div>
|
||||
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="280" height="63"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ab322409d0015c023d91c67b5b2679257"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ab322409d0015c023d91c67b5b2679257">◆ </a></span>Shortest_Path_Distance()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > & </td>
|
||||
<td class="paramname"><em>workset_</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t >> & </td>
|
||||
<td class="paramname"><em>distance_</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">workset_</td><td>vertices visited in the search </td></tr>
|
||||
<tr><td class="paramname">distance_</td><td>vector of distances from the source to the target and from the target to the source </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  {</div>
|
||||
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  int64_t <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>;</div>
|
||||
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">for</span> (uint64_t i : workset_) {</div>
|
||||
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (distance_[0][i] + distance_[1][i] < distance) {</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = distance_[0][i] + distance_[1][i];</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>  }</div>
|
||||
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keywordflow">return</span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a>;</div>
|
||||
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_ab322409d0015c023d91c67b5b2679257_cgraph.svg" width="174" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void tests </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Function to test the provided algorithm above. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  {</div>
|
||||
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initiatinig Predefined Tests..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initiating Test 1..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj1_1(</div>
|
||||
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  4, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj1_2(</div>
|
||||
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  4, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 1, 2, 1);</div>
|
||||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 4, 1, 2);</div>
|
||||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 2, 3, 2);</div>
|
||||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj1_1, &adj1_2, 1, 3, 5);</div>
|
||||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  </div>
|
||||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  uint64_t s = 1, t = 3;</div>
|
||||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  assert(graph::bidirectional_dijkstra::Bidijkstra(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  t - 1) == 3);</div>
|
||||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test 1 Passed..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
||||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  s = 4, t = 3;</div>
|
||||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initiating Test 2..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  assert(graph::bidirectional_dijkstra::Bidijkstra(&adj1_1, &adj1_2, s - 1,</div>
|
||||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  t - 1) == 5);</div>
|
||||
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test 2 Passed..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
||||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj2_1(</div>
|
||||
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  5, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<std::pair<uint64_t, uint64_t></a>>> adj2_2(</div>
|
||||
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  5, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair<uint64_t, uint64_t></a>>());</div>
|
||||
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 1, 2, 4);</div>
|
||||
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 1, 3, 2);</div>
|
||||
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 3, 2);</div>
|
||||
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 2, 1);</div>
|
||||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 4, 2);</div>
|
||||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 5, 4);</div>
|
||||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 5, 4, 1);</div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 2, 5, 3);</div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a>(&adj2_1, &adj2_2, 3, 4, 4);</div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  s = 1, t = 5;</div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Initiating Test 3..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  assert(graph::bidirectional_dijkstra::Bidijkstra(&adj2_1, &adj2_2, s - 1,</div>
|
||||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  t - 1) == 6);</div>
|
||||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test 3 Passed..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All Test Passed..."</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="182" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Variable Documentation</h2>
|
||||
<a id="a330a2b0a904f01802ada1f8f3b28e76c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">◆ </a></span>INF</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">constexpr int64_t INF = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a><int64_t>::max()</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">constexpr</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>for store the graph, the distances, and the path </p>
|
||||
<p>for assert for io operations for variable INF for the priority_queue of distances for make_pair function </p>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_aa3848a7213562b47084585499d3642a5"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:86</div></div>
|
||||
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
|
||||
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:199</div></div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_ab322409d0015c023d91c67b5b2679257"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector< uint64_t > &workset_, const std::vector< std::vector< uint64_t >> &distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:61</div></div>
|
||||
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
|
||||
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a6f92fe022b7e5d453f7257d763b6f3e2"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2">graph::bidirectional_dijkstra::addEdge</a></div><div class="ttdeci">void addEdge(std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj1, std::vector< std::vector< std::pair< uint64_t, uint64_t >>> *adj2, uint64_t u, uint64_t v, uint64_t w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:45</div></div>
|
||||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
|
||||
<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for store the graph, the distances, and the path</div><div class="ttdef"><b>Definition:</b> bidirectional_dijkstra.cpp:23</div></div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_dijkstra.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
9
d7/d07/bidirectional__dijkstra_8cpp.js
Normal file
9
d7/d07/bidirectional__dijkstra_8cpp.js
Normal file
@@ -0,0 +1,9 @@
|
||||
var bidirectional__dijkstra_8cpp =
|
||||
[
|
||||
[ "addEdge", "d7/d07/bidirectional__dijkstra_8cpp.html#a6f92fe022b7e5d453f7257d763b6f3e2", null ],
|
||||
[ "Bidijkstra", "d7/d07/bidirectional__dijkstra_8cpp.html#aa3848a7213562b47084585499d3642a5", null ],
|
||||
[ "main", "d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "Shortest_Path_Distance", "d7/d07/bidirectional__dijkstra_8cpp.html#ab322409d0015c023d91c67b5b2679257", null ],
|
||||
[ "tests", "d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ],
|
||||
[ "INF", "d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c", null ]
|
||||
];
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="node1" title="Function to test the provided algorithm above." alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,176,32"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
1c7fb027aa3a147f63a64ff734e1dfaf
|
||||
@@ -0,0 +1,37 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="136pt" height="28pt"
|
||||
viewBox="0.00 0.00 136.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>tests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 132,-24 132,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Function to test the provided algorithm above.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 38,-19.5 38,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-0.5 74,-19.5 128,-19.5 128,-0.5 74,-0.5"/>
|
||||
<text text-anchor="middle" x="101" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.15,-10C45.71,-10 54.76,-10 63.58,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.73,-13.5 73.73,-10 63.73,-6.5 63.73,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.6 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="graph::bidirectional_dijkstra::addEdge" name="graph::bidirectional_dijkstra::addEdge">
|
||||
<area shape="rect" id="node1" title="Function that add edge between two nodes or vertices of graph." alt="" coords="5,5,136,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="184,13,292,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
c65351a82e8b9a7954339d7445a6ccf0
|
||||
@@ -0,0 +1,38 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::bidirectional_dijkstra::addEdge Pages: 1 -->
|
||||
<svg width="223pt" height="39pt"
|
||||
viewBox="0.00 0.00 223.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
|
||||
<title>graph::bidirectional_dijkstra::addEdge</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 219,-35 219,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Function that add edge between two nodes or vertices of graph.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 98,-30.5 98,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
|
||||
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::addEdge</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="134,-6 134,-25 215,-25 215,-6 134,-6"/>
|
||||
<text text-anchor="middle" x="174.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M98.1,-15.5C106.48,-15.5 115.21,-15.5 123.64,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="123.71,-19 133.71,-15.5 123.71,-12 123.71,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="graph::bidirectional_dijkstra::Bidijkstra" name="graph::bidirectional_dijkstra::Bidijkstra">
|
||||
<area shape="rect" id="node1" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,29,139,71"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="187,37,295,63"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
ca86ac0d1e717b54fd428fdb97d32d48
|
||||
@@ -0,0 +1,44 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::bidirectional_dijkstra::Bidijkstra Pages: 1 -->
|
||||
<svg width="225pt" height="57pt"
|
||||
viewBox="0.00 0.00 225.00 57.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 53)">
|
||||
<title>graph::bidirectional_dijkstra::Bidijkstra</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 221,-53 221,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 100,-30.5 100,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
|
||||
<text text-anchor="middle" x="50" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Bidijkstra</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M28.04,-30.66C22.75,-40.06 30.07,-49 50,-49 62.15,-49 69.61,-45.68 72.39,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="75.87,-40.5 71.96,-30.66 68.88,-40.8 75.87,-40.5"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="136,-6 136,-25 217,-25 217,-6 136,-6"/>
|
||||
<text text-anchor="middle" x="176.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M100.21,-15.5C108.61,-15.5 117.35,-15.5 125.78,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="125.85,-19 135.85,-15.5 125.85,-12 125.85,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.2 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="graph::bidirectional_dijkstra::Shortest_Path_Distance" name="graph::bidirectional_dijkstra::Shortest_Path_Distance">
|
||||
<area shape="rect" id="node1" title="This function returns the shortest distance from the source to the target if there is path between ve..." alt="" coords="5,29,168,85"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
ea8eef30121654ffde794214809d24a9
|
||||
@@ -0,0 +1,30 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: graph::bidirectional_dijkstra::Shortest_Path_Distance Pages: 1 -->
|
||||
<svg width="130pt" height="68pt"
|
||||
viewBox="0.00 0.00 130.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
|
||||
<title>graph::bidirectional_dijkstra::Shortest_Path_Distance</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 126,-64 126,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="This function returns the shortest distance from the source to the target if there is path between ve...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 122,-41.5 122,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Shortest_Path</text>
|
||||
<text text-anchor="middle" x="61" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_Distance</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.58,-41.86C36.13,-51.54 43.61,-60 61,-60 71.87,-60 78.87,-56.7 81.99,-51.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="85.47,-52.26 83.42,-41.86 78.54,-51.27 85.47,-52.26"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.7 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,5,56,32"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="203,5,275,32"/>
|
||||
<area shape="rect" id="node3" href="$d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Function to test the provided algorithm above." alt="" coords="104,31,155,57"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
592054830d184d0b8f94a261f2cdf931
|
||||
@@ -0,0 +1,58 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="210pt" height="47pt"
|
||||
viewBox="0.00 0.00 210.00 47.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 43)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-43 206,-43 206,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-19.5 0,-38.5 38,-38.5 38,-19.5 0,-19.5"/>
|
||||
<text text-anchor="middle" x="19" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="148,-19.5 148,-38.5 202,-38.5 202,-19.5 148,-19.5"/>
|
||||
<text text-anchor="middle" x="175" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.27,-29C62.68,-29 106.48,-29 137.72,-29"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.78,-32.5 147.78,-29 137.78,-25.5 137.78,-32.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Function to test the provided algorithm above.">
|
||||
<polygon fill="white" stroke="black" points="74,-0.5 74,-19.5 112,-19.5 112,-0.5 74,-0.5"/>
|
||||
<text text-anchor="middle" x="93" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.17,-24.21C45.95,-22.15 55.23,-19.7 63.87,-17.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="64.81,-20.79 73.59,-14.86 63.02,-14.03 64.81,-20.79"/>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.15,-14.31C119.79,-16.13 128.96,-18.3 137.87,-20.42"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.19,-23.85 147.73,-22.76 138.8,-17.04 137.19,-23.85"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.7 KiB |
@@ -118,7 +118,7 @@ Include dependency graph for dijkstra.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:df/dce/namespacegraph"><td class="mdescLeft"> </td><td class="mdescRight"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
@@ -195,7 +195,7 @@ constexpr int64_t </td><td class="memItemRight" valign="bottom"><b>INF</b>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="486" height="163"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d1e/graph_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="528" height="323"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -256,7 +256,7 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="387" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d1e/graph_2dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="430" height="323"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
|
||||
@@ -1,7 +1,12 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,56,56,83"/>
|
||||
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" title="Function that add edge between two nodes or vertices of graph." alt="" coords="104,5,217,32"/>
|
||||
<area shape="rect" id="node3" href="$df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="109,56,213,83"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="125,107,197,133"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="265,56,381,83"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,151,56,178"/>
|
||||
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" title="Function that add edge between two nodes or vertices of graph." alt="" coords="104,101,217,127"/>
|
||||
<area shape="rect" id="node3" href="$df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="109,151,213,178"/>
|
||||
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="125,202,197,229"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="280,5,409,47"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="291,71,399,98"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="265,122,424,149"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="280,173,409,215"/>
|
||||
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="287,239,403,266"/>
|
||||
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="267,290,422,317"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a9a5114fdc641ce208647b7c3c87be7f
|
||||
dfd47b69876fa92d0282ee35af978c54
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="290pt" height="104pt"
|
||||
viewBox="0.00 0.00 290.00 104.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 100)">
|
||||
<svg width="322pt" height="242pt"
|
||||
viewBox="0.00 0.00 322.00 241.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 237.5)">
|
||||
<title>tests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 286,-100 286,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-237.5 318,-237.5 318,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 38,-57.5 38,-38.5 0,-38.5"/>
|
||||
<text text-anchor="middle" x="19" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-104.5 0,-123.5 38,-123.5 38,-104.5 0,-104.5"/>
|
||||
<text text-anchor="middle" x="19" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,61 +22,138 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
|
||||
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 159,-95.5 159,-76.5 74,-76.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
|
||||
<polygon fill="white" stroke="black" points="74,-142.5 74,-161.5 159,-161.5 159,-142.5 74,-142.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-149.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-55.33C50.66,-60.2 67.1,-66.74 81.65,-72.53"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="80.77,-75.95 91.36,-76.39 83.36,-69.44 80.77,-75.95"/>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-121.33C50.66,-126.2 67.1,-132.74 81.65,-138.53"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="80.77,-141.95 91.36,-142.39 83.36,-135.44 80.77,-141.95"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
|
||||
<polygon fill="white" stroke="black" points="77.5,-38.5 77.5,-57.5 155.5,-57.5 155.5,-38.5 77.5,-38.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
|
||||
<polygon fill="white" stroke="black" points="77.5,-104.5 77.5,-123.5 155.5,-123.5 155.5,-104.5 77.5,-104.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-48C46.71,-48 56.93,-48 67.18,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="67.38,-51.5 77.38,-48 67.38,-44.5 67.38,-51.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-114C46.71,-114 56.93,-114 67.18,-114"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="67.38,-117.5 77.38,-114 67.38,-110.5 67.38,-117.5"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="89.5,-0.5 89.5,-19.5 143.5,-19.5 143.5,-0.5 89.5,-0.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="89.5,-66.5 89.5,-85.5 143.5,-85.5 143.5,-66.5 89.5,-66.5"/>
|
||||
<text text-anchor="middle" x="116.5" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-40.67C50.66,-35.8 67.1,-29.26 81.65,-23.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="83.36,-26.56 91.36,-19.61 80.77,-20.05 83.36,-26.56"/>
|
||||
<!-- Node1->Node10 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.41,-106.67C50.66,-101.8 67.1,-95.26 81.65,-89.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="83.36,-92.56 91.36,-85.61 80.77,-86.05 83.36,-92.56"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="195,-38.5 195,-57.5 282,-57.5 282,-38.5 195,-38.5"/>
|
||||
<text text-anchor="middle" x="238.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="206,-203 206,-233 303,-233 303,-203 206,-203"/>
|
||||
<text text-anchor="start" x="214" y="-221" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
|
||||
<text text-anchor="middle" x="254.5" y="-210" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M155.8,-48C165.06,-48 175.13,-48 184.92,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="184.99,-51.5 194.99,-48 184.99,-44.5 184.99,-51.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M144.84,-123.66C149.89,-126.21 154.87,-129.3 159,-133 182.18,-153.74 171.56,-172.56 195,-193 196.76,-194.53 198.63,-195.98 200.57,-197.35"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="199.16,-200.6 209.51,-202.87 202.83,-194.64 199.16,-200.6"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="214,-164.5 214,-183.5 295,-183.5 295,-164.5 214,-164.5"/>
|
||||
<text text-anchor="middle" x="254.5" y="-171.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node3->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M139.71,-123.58C146.02,-126.46 152.84,-129.72 159,-133 175.55,-141.81 177.97,-147.16 195,-155 199.73,-157.18 204.78,-159.21 209.85,-161.08"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="208.98,-164.48 219.57,-164.47 211.28,-157.87 208.98,-164.48"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="195,-126.5 195,-145.5 314,-145.5 314,-126.5 195,-126.5"/>
|
||||
<text text-anchor="middle" x="254.5" y="-133.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node3->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M155.75,-120.19C164.88,-121.66 174.9,-123.29 184.95,-124.91"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="184.53,-128.39 194.96,-126.53 185.65,-121.48 184.53,-128.39"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="206,-77 206,-107 303,-107 303,-77 206,-77"/>
|
||||
<text text-anchor="start" x="214" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
|
||||
<text text-anchor="middle" x="254.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node7 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node3->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M155.75,-107.81C168.14,-105.81 182.18,-103.54 195.67,-101.35"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="196.54,-104.76 205.85,-99.71 195.42,-97.85 196.54,-104.76"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="211,-38.5 211,-57.5 298,-57.5 298,-38.5 211,-38.5"/>
|
||||
<text text-anchor="middle" x="254.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node8 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node3->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M140.78,-104.4C146.84,-101.62 153.28,-98.4 159,-95 176.19,-84.78 177.32,-77.35 195,-68 199.8,-65.46 204.99,-63.14 210.23,-61.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="211.48,-64.33 219.64,-57.56 209.05,-57.77 211.48,-64.33"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="196.5,-0.5 196.5,-19.5 312.5,-19.5 312.5,-0.5 196.5,-0.5"/>
|
||||
<text text-anchor="middle" x="254.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node9 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node3->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M144.96,-104.48C150,-101.92 154.94,-98.78 159,-95 183.44,-72.21 169.29,-50.34 195,-29 197.05,-27.3 199.25,-25.75 201.57,-24.34"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="203.6,-27.23 210.9,-19.55 200.4,-21 203.6,-27.23"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.9 KiB After Width: | Height: | Size: 8.3 KiB |
@@ -1,8 +1,13 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,68,56,95"/>
|
||||
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" title="Function that add edge between two nodes or vertices of graph." alt="" coords="203,5,316,32"/>
|
||||
<area shape="rect" id="node3" href="$df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="207,68,311,95"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="223,131,295,157"/>
|
||||
<area shape="rect" id="node6" href="$d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="104,43,155,69"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="364,68,480,95"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,163,56,190"/>
|
||||
<area shape="rect" id="node2" href="$df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" title="Function that add edge between two nodes or vertices of graph." alt="" coords="203,94,316,121"/>
|
||||
<area shape="rect" id="node3" href="$df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="207,151,311,178"/>
|
||||
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="223,214,295,241"/>
|
||||
<area shape="rect" id="node11" href="$d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="104,138,155,165"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="379,5,508,47"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="389,71,497,98"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="364,122,523,149"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="379,173,508,215"/>
|
||||
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="385,239,501,266"/>
|
||||
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="366,290,521,317"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
908c206fcb1ad75479951361066af7e2
|
||||
dab6a49121b6c8c729a68f4d5cd3daf5
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="364pt" height="122pt"
|
||||
viewBox="0.00 0.00 364.00 122.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 118)">
|
||||
<svg width="396pt" height="242pt"
|
||||
viewBox="0.00 0.00 396.00 241.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 237.5)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-118 360,-118 360,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-237.5 392,-237.5 392,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-47.5 0,-66.5 38,-66.5 38,-47.5 0,-47.5"/>
|
||||
<text text-anchor="middle" x="19" y="-54.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-95.5 0,-114.5 38,-114.5 38,-95.5 0,-95.5"/>
|
||||
<text text-anchor="middle" x="19" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,94 +22,171 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../df/dce/namespacegraph.html#a372ff051a7bc6c91d34a7b58edf8dfce" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
|
||||
<polygon fill="white" stroke="black" points="148,-94.5 148,-113.5 233,-113.5 233,-94.5 148,-94.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-101.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
|
||||
<polygon fill="white" stroke="black" points="148,-147.5 148,-166.5 233,-166.5 233,-147.5 148,-147.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M30.19,-66.75C40.38,-75.83 56.96,-88.87 74,-95 94.07,-102.23 117.34,-105.01 137.71,-105.79"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.68,-109.29 147.76,-106.03 137.85,-102.29 137.68,-109.29"/>
|
||||
<path fill="none" stroke="midnightblue" d="M30.25,-114.59C40.49,-123.55 57.09,-136.5 74,-143 94.08,-150.72 117.44,-154.44 137.88,-156.15"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="137.74,-159.65 147.96,-156.85 138.23,-152.66 137.74,-159.65"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../df/dce/namespacegraph.html#a868530bfaed30e57290a76d5b4402d50" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
|
||||
<polygon fill="white" stroke="black" points="151.5,-47.5 151.5,-66.5 229.5,-66.5 229.5,-47.5 151.5,-47.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-54.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
|
||||
<polygon fill="white" stroke="black" points="151.5,-104.5 151.5,-123.5 229.5,-123.5 229.5,-104.5 151.5,-104.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.14,-57C62.52,-57 106.77,-57 141.15,-57"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="141.47,-60.5 151.47,-57 141.47,-53.5 141.47,-60.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M38.35,-104.38C56.93,-103.89 86.49,-103.52 112,-105 121.43,-105.55 131.48,-106.46 141.11,-107.51"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="141.01,-111.02 151.34,-108.68 141.8,-104.06 141.01,-111.02"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="163.5,-0.5 163.5,-19.5 217.5,-19.5 217.5,-0.5 163.5,-0.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="163.5,-57.5 163.5,-76.5 217.5,-76.5 217.5,-57.5 163.5,-57.5"/>
|
||||
<text text-anchor="middle" x="190.5" y="-64.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.14,-51.97C65.58,-44.36 118.18,-29.78 153.56,-19.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="154.8,-23.26 163.5,-17.21 152.93,-16.51 154.8,-23.26"/>
|
||||
<!-- Node1->Node10 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node1->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.14,-100.93C65.58,-94.78 118.18,-82.99 153.56,-75.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="154.5,-78.43 163.5,-72.83 152.97,-71.6 154.5,-78.43"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-66.5 74,-85.5 112,-85.5 112,-66.5 74,-66.5"/>
|
||||
<text text-anchor="middle" x="93" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
<!-- Node11 -->
|
||||
<g id="node11" class="node">
|
||||
<title>Node11</title>
|
||||
<g id="a_node11"><a xlink:href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-114.5 74,-133.5 112,-133.5 112,-114.5 74,-114.5"/>
|
||||
<text text-anchor="middle" x="93" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.17,-61.79C45.95,-63.85 55.23,-66.3 63.87,-68.58"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.02,-71.97 73.59,-71.14 64.81,-65.21 63.02,-71.97"/>
|
||||
<!-- Node1->Node11 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node1->Node11</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.17,-109.79C45.95,-111.85 55.23,-114.3 63.87,-116.58"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.02,-119.97 73.59,-119.14 64.81,-113.21 63.02,-119.97"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="269,-47.5 269,-66.5 356,-66.5 356,-47.5 269,-47.5"/>
|
||||
<text text-anchor="middle" x="312.5" y="-54.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="280,-203 280,-233 377,-233 377,-203 280,-203"/>
|
||||
<text text-anchor="start" x="288" y="-221" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
|
||||
<text text-anchor="middle" x="328.5" y="-210" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M229.8,-57C239.06,-57 249.13,-57 258.92,-57"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="258.99,-60.5 268.99,-57 258.99,-53.5 258.99,-60.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M212.22,-123.5C219.3,-127.37 226.95,-132.28 233,-138 254.22,-158.08 246.61,-174.23 269,-193 270.96,-194.65 273.05,-196.2 275.22,-197.66"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="273.57,-200.75 283.95,-202.86 277.15,-194.74 273.57,-200.75"/>
|
||||
</g>
|
||||
<!-- Node6->Node2 -->
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="288,-164.5 288,-183.5 369,-183.5 369,-164.5 288,-164.5"/>
|
||||
<text text-anchor="middle" x="328.5" y="-171.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node3->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M207.73,-123.64C223.14,-132.55 247.13,-145.75 269,-155 274.1,-157.16 279.54,-159.22 284.96,-161.14"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="284.05,-164.53 294.64,-164.43 286.3,-157.9 284.05,-164.53"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="269,-126.5 269,-145.5 388,-145.5 388,-126.5 269,-126.5"/>
|
||||
<text text-anchor="middle" x="328.5" y="-133.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node3->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M229.75,-120.19C238.88,-121.66 248.9,-123.29 258.95,-124.91"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="258.53,-128.39 268.96,-126.53 259.65,-121.48 258.53,-128.39"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="280,-77 280,-107 377,-107 377,-77 280,-77"/>
|
||||
<text text-anchor="start" x="288" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
|
||||
<text text-anchor="middle" x="328.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node7 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node6->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.41,-81.4C122.34,-84.31 135.02,-88.03 147.22,-91.6"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="146.25,-94.97 156.83,-94.42 148.22,-88.25 146.25,-94.97"/>
|
||||
<title>Node3->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M229.75,-107.81C242.14,-105.81 256.18,-103.54 269.67,-101.35"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="270.54,-104.76 279.85,-99.71 269.42,-97.85 270.54,-104.76"/>
|
||||
</g>
|
||||
<!-- Node6->Node3 -->
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="285,-38.5 285,-57.5 372,-57.5 372,-38.5 285,-38.5"/>
|
||||
<text text-anchor="middle" x="328.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node8 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node6->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.41,-72.34C120.79,-70.67 131.14,-68.61 141.5,-66.55"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="142.25,-69.97 151.38,-64.58 140.89,-63.1 142.25,-69.97"/>
|
||||
<title>Node3->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M205.24,-104.32C220.33,-94.01 245.54,-77.75 269,-67 273.73,-64.83 278.78,-62.8 283.86,-60.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="285.29,-64.14 293.58,-57.55 282.99,-57.53 285.29,-64.14"/>
|
||||
</g>
|
||||
<!-- Node6->Node5 -->
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="270.5,-0.5 270.5,-19.5 386.5,-19.5 386.5,-0.5 270.5,-0.5"/>
|
||||
<text text-anchor="middle" x="328.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node9 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.71,-66.24C118.59,-58.52 134.22,-47.5 148,-38 154.06,-33.82 160.65,-29.35 166.76,-25.23"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="168.9,-28.01 175.24,-19.52 164.99,-22.2 168.9,-28.01"/>
|
||||
<title>Node3->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M209.27,-104.28C217.12,-99.44 226.1,-93.11 233,-86 253.86,-64.5 245.34,-47.39 269,-29 271.33,-27.19 273.84,-25.54 276.47,-24.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="278.25,-27.08 285.73,-19.57 275.2,-20.78 278.25,-27.08"/>
|
||||
</g>
|
||||
<!-- Node11->Node2 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node11->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.41,-130.36C123.67,-134.25 138.47,-139.37 152.09,-144.07"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="151.14,-147.45 161.73,-147.41 153.42,-140.83 151.14,-147.45"/>
|
||||
</g>
|
||||
<!-- Node11->Node3 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node11->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M112.41,-122.07C120.71,-121.2 130.93,-120.13 141.18,-119.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="141.8,-122.51 151.38,-117.99 141.07,-115.55 141.8,-122.51"/>
|
||||
</g>
|
||||
<!-- Node11->Node10 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node11->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M110.2,-114.33C125.11,-105.43 147.44,-92.1 164.61,-81.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="166.75,-84.66 173.54,-76.53 163.16,-78.65 166.75,-84.66"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 5.7 KiB After Width: | Height: | Size: 10 KiB |
@@ -245,7 +245,7 @@ $(document).ready(function(){initNavTree('d7/dba/cll_8h_source.html','../../');
|
||||
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> avltree.cpp:134</div></div>
|
||||
<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix< T > &A)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:90</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph algorithms.</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a629be41c1ab78850963e4ce14e1d11d9"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">ciphers::HillCipher::rand_range</a></div><div class="ttdeci">static const T2 rand_range(T1 a, T1 b)</div><div class="ttdoc">Function to generate a random integer in a given interval.</div><div class="ttdef"><b>Definition:</b> hill_cipher.cpp:92</div></div>
|
||||
<div class="ttc" id="anamespacen__queens__optimized_html"><div class="ttname"><a href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</a></div><div class="ttdoc">Functions for Eight Queens puzzle optimized.</div></div>
|
||||
<div class="ttc" id="ahill__cipher_8cpp_html_aeff09ac6b8f060c828354394a3189519"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#aeff09ac6b8f060c828354394a3189519">operator<<</a></div><div class="ttdeci">static std::ostream & operator<<(std::ostream &out, matrix< T > const &v)</div><div class="ttdef"><b>Definition:</b> hill_cipher.cpp:54</div></div>
|
||||
|
||||
Reference in New Issue
Block a user