backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-27 08:51:41 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
d7/d07/bidirectional__dijkstra_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<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"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -121,34 +121,34 @@ Include dependency graph for bidirectional_dijkstra.cpp:</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
<tr class="memitem:df/dce/namespacegraph" id="r_df/dce/namespacegraph"><td class="memItemLeft" align="right" valign="top">namespace &#160;</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">&#160;</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">&#160;</td></tr>
<tr class="memitem:d4/d13/namespacebidirectional__dijkstra"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></td></tr>
<tr class="memitem:d4/d13/namespacebidirectional__dijkstra" id="r_d4/d13/namespacebidirectional__dijkstra"><td class="memItemLeft" align="right" valign="top">namespace &#160;</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">&#160;</td><td class="mdescRight">Functions for [Bidirectional Dijkstra Shortest Path] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) algorithm. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a69172365aebde9be1997157f6f80e0cf"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
<tr class="memitem:a69172365aebde9be1997157f6f80e0cf" id="r_a69172365aebde9be1997157f6f80e0cf"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
<tr class="memdesc:a69172365aebde9be1997157f6f80e0cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph. <br /></td></tr>
<tr class="separator:a69172365aebde9be1997157f6f80e0cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">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>&lt; uint64_t &gt; &amp;workset_, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &gt; &amp;distance_)</td></tr>
<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6" id="r_a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">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>&lt; uint64_t &gt; &amp;workset_, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &gt; &amp;distance_)</td></tr>
<tr class="memdesc:a22f1b7277e1dd4190f25014b48487ce6"><td class="mdescLeft">&#160;</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'. <br /></td></tr>
<tr class="separator:a22f1b7277e1dd4190f25014b48487ce6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</td></tr>
<tr class="memitem:a1b2df3d52a403ad46523ab90d3a723c1" id="r_a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</td></tr>
<tr class="memdesc:a1b2df3d52a403ad46523ab90d3a723c1"><td class="mdescLeft">&#160;</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. <br /></td></tr>
<tr class="separator:a1b2df3d52a403ad46523ab90d3a723c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</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">&#160;</td><td class="mdescRight">Function to test the provided algorithm above. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</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">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</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>&lt;int64_t&gt;::max()</td></tr>
<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</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>&lt;int64_t&gt;::max()</td></tr>
<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">for store the graph, the distances, and the path <br /></td></tr>
<tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -653,7 +653,7 @@ Here is the call graph for this function:</div>
<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="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </li>
</ul>
</div>
</body>

6
d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.map
View File

@@ -1,11 +1,11 @@
<map id="graph::bidirectional_dijkstra::Bidijkstra" name="graph::bidirectional_dijkstra::Bidijkstra">
<area shape="rect" id="Node000001" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,47,138,88"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="34,47,33,37,39,28,52,23,72,21,93,23,106,30,103,34,92,28,71,26,53,28,42,32,38,38,40,46"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="34,47,33,37,39,28,52,23,72,21,93,23,105,29,103,34,91,28,71,26,53,28,42,32,38,38,40,46"/>
<area shape="rect" id="Node000002" 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="213,5,320,31"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="137,48,198,33,199,38,139,53"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="189,55,344,80"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="138,65,174,65,174,70,138,70"/>
<area shape="rect" id="Node000004" href="$d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6" title="This function returns the shortest distance from the source to the target if there is path between ve..." alt="" coords="186,129,347,185"/>
<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="119,86,192,120,190,125,117,91"/>
<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="228,128,228,119,235,110,248,104,266,102,288,105,300,112,298,117,286,110,266,108,249,109,238,114,233,120,233,129"/>
<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="119,86,191,120,189,124,117,91"/>
<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="228,128,228,119,235,110,248,104,266,102,287,105,300,112,297,117,285,110,266,108,249,109,238,114,233,120,233,129"/>
</map>

22
d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::Bidijkstra Pages: 1 -->
<svg width="264pt" height="143pt"
@@ -32,8 +32,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 62.31,-121.12 70.59,-118.45 74.46,-114.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.04,-114.9 75.52,-104.61 71.07,-114.23 78.04,-114.9"/>
<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 61.96,-121.12 70.12,-118.6 74.13,-114.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.58,-115.47 75.33,-105.11 70.63,-114.61 77.58,-115.47"/>
</a>
</g>
</g>
@@ -50,8 +50,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114.14,-104.18 130.31,-108.33 145.09,-112.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144,-115.72 154.56,-114.81 145.74,-108.94 144,-115.72"/>
<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114,-104.14 130,-108.25 144.65,-112.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.54,-115.34 154.09,-114.44 145.28,-108.56 143.54,-115.34"/>
</a>
</g>
</g>
@@ -68,8 +68,8 @@
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.22,-87.88 117.55,-87.88 126.78,-87.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.54,-91.38 136.54,-87.88 126.54,-84.38 126.54,-91.38"/>
<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.03,-87.88 117.14,-87.88 126.18,-87.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.03,-91.38 136.03,-87.88 126.03,-84.38 126.03,-91.38"/>
</a>
</g>
</g>
@@ -88,8 +88,8 @@
<g id="edge4_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.71,-64.59 120.68,-55.31 139.12,-46.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.3,-49.58 147.89,-42.19 137.35,-43.23 140.3,-49.58"/>
<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.56,-64.66 120.31,-55.48 138.61,-46.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.93,-50.22 147.52,-42.83 136.98,-43.87 139.93,-50.22"/>
</a>
</g>
</g>
@@ -97,8 +97,8 @@
<g id="edge5_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.95,-59.75 216.08,-56.86 220.13,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="223.71,-53.62 222.72,-43.07 216.92,-51.93 223.71,-53.62"/>
<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.63,-59.75 215.65,-57.01 219.8,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="223.09,-54.1 222.33,-43.53 216.34,-52.27 223.09,-54.1"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

22
d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::Bidijkstra Pages: 1 -->
<svg width="264pt" height="143pt"
@@ -22,8 +22,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 62.31,-121.12 70.59,-118.45 74.46,-114.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.04,-114.9 75.52,-104.61 71.07,-114.23 78.04,-114.9"/>
<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 61.96,-121.12 70.12,-118.6 74.13,-114.83"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="77.58,-115.47 75.33,-105.11 70.63,-114.61 77.58,-115.47"/>
</a>
</g>
</g>
@@ -40,8 +40,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114.14,-104.18 130.31,-108.33 145.09,-112.13"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144,-115.72 154.56,-114.81 145.74,-108.94 144,-115.72"/>
<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114,-104.14 130,-108.25 144.65,-112.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.54,-115.34 154.09,-114.44 145.28,-108.56 143.54,-115.34"/>
</a>
</g>
</g>
@@ -58,8 +58,8 @@
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.22,-87.88 117.55,-87.88 126.78,-87.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.54,-91.38 136.54,-87.88 126.54,-84.38 126.54,-91.38"/>
<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.03,-87.88 117.14,-87.88 126.18,-87.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.03,-91.38 136.03,-87.88 126.03,-84.38 126.03,-91.38"/>
</a>
</g>
</g>
@@ -78,8 +78,8 @@
<g id="edge4_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.71,-64.59 120.68,-55.31 139.12,-46.73"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="140.3,-49.58 147.89,-42.19 137.35,-43.23 140.3,-49.58"/>
<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.56,-64.66 120.31,-55.48 138.61,-46.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.93,-50.22 147.52,-42.83 136.98,-43.87 139.93,-50.22"/>
</a>
</g>
</g>
@@ -87,8 +87,8 @@
<g id="edge5_Node000004_Node000004" class="edge">
<title>Node4&#45;&gt;Node4</title>
<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.95,-59.75 216.08,-56.86 220.13,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="223.71,-53.62 222.72,-43.07 216.92,-51.93 223.71,-53.62"/>
<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.63,-59.75 215.65,-57.01 219.8,-52.86"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="223.09,-54.1 222.33,-43.53 216.34,-52.27 223.09,-54.1"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.8 KiB

After

Width:  |  Height:  |  Size: 4.8 KiB

2
d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.map
View File

@@ -1,4 +1,4 @@
<map id="graph::bidirectional_dijkstra::Shortest_Path_Distance" name="graph::bidirectional_dijkstra::Shortest_Path_Distance">
<area shape="rect" id="Node000001" title="This function returns the shortest distance from the source to the target if there is path between ve..." alt="" coords="5,29,167,85"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,54,19,60,10,71,5,86,3,104,6,114,13,111,17,102,10,86,8,72,10,63,14,59,21,59,29"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,54,19,60,10,71,5,86,3,103,5,114,12,111,16,101,10,86,8,72,10,63,14,59,21,59,29"/>
</map>

6
d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::Shortest_Path_Distance Pages: 1 -->
<svg width="129pt" height="68pt"
@@ -33,8 +33,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.6,-59.75 77.33,-56.86 80.69,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="84.25,-53.57 82.83,-43.07 77.39,-52.16 84.25,-53.57"/>
<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.07,-59.75 76.61,-57.16 80.13,-53.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.52,-54.08 82.48,-43.54 76.71,-52.43 83.52,-54.08"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

6
d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::Shortest_Path_Distance Pages: 1 -->
<svg width="129pt" height="68pt"
@@ -23,8 +23,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.6,-59.75 77.33,-56.86 80.69,-52.53"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="84.25,-53.57 82.83,-43.07 77.39,-52.16 84.25,-53.57"/>
<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.07,-59.75 76.61,-57.16 80.13,-53.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="83.52,-54.08 82.48,-43.54 76.71,-52.43 83.52,-54.08"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Function to test the provided algorithm above." alt="" coords="5,5,56,31"/>
<area shape="rect" id="Node000002" 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,175,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,89,16,89,21,56,21"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
</map>

6
d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: tests Pages: 1 -->
<svg width="135pt" height="27pt"
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.22,-9.62 53.89,-9.62 62.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.35,-13.13 72.35,-9.62 62.35,-6.13 62.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

6
d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: tests Pages: 1 -->
<svg width="135pt" height="27pt"
@@ -30,8 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.22,-9.62 53.89,-9.62 62.39,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.35,-13.13 72.35,-9.62 62.35,-6.13 62.35,-13.13"/>
<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

4
d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.map
View File

@@ -1,6 +1,6 @@
<map id="graph::bidirectional_dijkstra::addEdge" name="graph::bidirectional_dijkstra::addEdge">
<area shape="rect" id="Node000001" title="Function that add edge between two nodes or vertices of graph." alt="" coords="5,29,136,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="38,29,37,19,42,11,53,5,71,3,89,5,100,12,97,16,88,10,70,8,55,10,46,14,42,20,44,28"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="38,29,37,19,42,11,53,5,71,3,89,5,100,11,97,16,87,10,70,8,55,10,46,14,42,20,44,28"/>
<area shape="rect" id="Node000002" 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,37,291,63"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="136,47,169,47,169,52,136,52"/>
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="136,47,168,47,168,52,136,52"/>
</map>

10
d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::addEdge Pages: 1 -->
<svg width="222pt" height="57pt"
@@ -32,8 +32,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.73,-48.5 66.82,-45.83 70.14,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.71,-42.24 71.05,-31.99 66.73,-41.66 73.71,-42.24"/>
<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.43,-48.5 66.43,-45.97 69.86,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.31,-42.8 70.89,-32.49 66.35,-42.07 73.31,-42.8"/>
</a>
</g>
</g>
@@ -50,8 +50,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.24,-15.25 114.62,-15.25 122.73,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.56,-18.75 132.56,-15.25 122.56,-11.75 122.56,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.06,-15.25 114.24,-15.25 122.17,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.05,-18.75 132.05,-15.25 122.05,-11.75 122.05,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.1 KiB

After

Width:  |  Height:  |  Size: 3.1 KiB

10
d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: graph::bidirectional_dijkstra::addEdge Pages: 1 -->
<svg width="222pt" height="57pt"
@@ -22,8 +22,8 @@
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.73,-48.5 66.82,-45.83 70.14,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.71,-42.24 71.05,-31.99 66.73,-41.66 73.71,-42.24"/>
<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.43,-48.5 66.43,-45.97 69.86,-42.2"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="73.31,-42.8 70.89,-32.49 66.35,-42.07 73.31,-42.8"/>
</a>
</g>
</g>
@@ -40,8 +40,8 @@
<g id="edge2_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.24,-15.25 114.62,-15.25 122.73,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.56,-18.75 132.56,-15.25 122.56,-11.75 122.56,-18.75"/>
<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.06,-15.25 114.24,-15.25 122.17,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.05,-18.75 132.05,-15.25 122.05,-11.75 122.05,-18.75"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

6
d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,8 +1,8 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,186,16,186,21,55,21"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,185,16,185,21,55,21"/>
<area shape="rect" id="Node000003" href="$d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Function to test the provided algorithm above." alt="" coords="103,31,153,56"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,88,36,54,27"/>
<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,186,27,187,32,154,40"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,185,27,186,33,154,40"/>
</map>

14
d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="208pt" height="46pt"
@@ -40,8 +40,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.29,-28.62 104.38,-28.62 135.48,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.34,-32.13 145.34,-28.62 135.34,-25.13 135.34,-32.13"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
</a>
</g>
</g>
@@ -58,8 +58,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.81,-21.89 53.98,-19.45 62.55,-17.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.18,-20.35 71.94,-14.4 61.38,-13.59 63.18,-20.35"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
</a>
</g>
</g>
@@ -67,8 +67,8 @@
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.3,-15.69 127.08,-17.79 135.68,-19.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.81,-23.47 145.35,-22.38 136.43,-16.66 134.81,-23.47"/>
<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.7 KiB

14
d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -1,7 +1,7 @@
<?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 8.1.0 (20230707.0739)
<!-- Generated by graphviz version 9.0.0 (20230911.1827)
-->
<!-- Title: main Pages: 1 -->
<svg width="208pt" height="46pt"
@@ -30,8 +30,8 @@
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.29,-28.62 104.38,-28.62 135.48,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.34,-32.13 145.34,-28.62 135.34,-25.13 135.34,-32.13"/>
<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
</a>
</g>
</g>
@@ -48,8 +48,8 @@
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.81,-21.89 53.98,-19.45 62.55,-17.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.18,-20.35 71.94,-14.4 61.38,-13.59 63.18,-20.35"/>
<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
</a>
</g>
</g>
@@ -57,8 +57,8 @@
<g id="edge3_Node000003_Node000002" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.3,-15.69 127.08,-17.79 135.68,-19.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.81,-23.47 145.35,-22.38 136.43,-16.66 134.81,-23.47"/>
<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB