Documentation for 85d62bb80d

2026-05-11 19:17:21 +08:00 · 2024-11-01 17:23:36 +00:00
parent db0fed538b
commit 589b446f88
297 changed files with 3602 additions and 1265 deletions
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph.html
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph.html
@@ -0,0 +1,303 @@
+<!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" lang="en-US">
+<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.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>Algorithms_in_C++: graph::topological_sort::Graph Class 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>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.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 id="projectrow">
+  <td id="projectalign">
+   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/dec/classgraph_1_1topological__sort_1_1_graph.html','../../'); initResizable(true); });
+/* @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">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="summary">
+<a href="#pub-methods">Public Member Functions</a> &#124;
+<a href="#pri-attribs">Private Attributes</a> &#124;
+<a href="../../d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html">List of all members</a>  </div>
+  <div class="headertitle"><div class="title">graph::topological_sort::Graph Class Reference</div></div>
+</div><!--header-->
+<div class="contents">
+
+<p>Class that represents a directed graph and provides methods for manipulating the graph.  
+ <a href="#details">More...</a></p>
+<div class="dynheader">
+Collaboration diagram for graph::topological_sort::Graph:</div>
+<div class="dyncontent">
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg" width="168" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
+Public Member Functions</h2></td></tr>
+<tr class="memitem:a75a849f80a66304e7da39b3ccd6129d6" id="r_a75a849f80a66304e7da39b3ccd6129d6"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75a849f80a66304e7da39b3ccd6129d6">Graph</a> (int nodes)</td></tr>
+<tr class="memdesc:a75a849f80a66304e7da39b3ccd6129d6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor for the <a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html" title="Class that represents a directed graph and provides methods for manipulating the graph.">Graph</a> class.  <br /></td></tr>
+<tr class="separator:a75a849f80a66304e7da39b3ccd6129d6"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a57036210706a45b9363563252393a345" id="r_a57036210706a45b9363563252393a345"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a57036210706a45b9363563252393a345">addEdge</a> (int u, int v)</td></tr>
+<tr class="memdesc:a57036210706a45b9363563252393a345"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that adds an edge between two nodes or vertices of graph.  <br /></td></tr>
+<tr class="separator:a57036210706a45b9363563252393a345"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a5e84b175ef768ff58eaeededd43e8368" id="r_a5e84b175ef768ff58eaeededd43e8368"><td class="memItemLeft" align="right" valign="top">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; int &gt; &gt; &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e84b175ef768ff58eaeededd43e8368">getAdjacencyList</a> () const</td></tr>
+<tr class="memdesc:a5e84b175ef768ff58eaeededd43e8368"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the adjacency list of the graph.  <br /></td></tr>
+<tr class="separator:a5e84b175ef768ff58eaeededd43e8368"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ad22018e4f4f80aecb0538044bb83d096" id="r_ad22018e4f4f80aecb0538044bb83d096"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad22018e4f4f80aecb0538044bb83d096">getNumNodes</a> () const</td></tr>
+<tr class="memdesc:ad22018e4f4f80aecb0538044bb83d096"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the number of nodes in the graph.  <br /></td></tr>
+<tr class="separator:ad22018e4f4f80aecb0538044bb83d096"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table><table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
+Private Attributes</h2></td></tr>
+<tr class="memitem:ad397d1dfbb62c7b612baeebe8cc83057" id="r_ad397d1dfbb62c7b612baeebe8cc83057"><td class="memItemLeft" align="right" valign="top"><a id="ad397d1dfbb62c7b612baeebe8cc83057" name="ad397d1dfbb62c7b612baeebe8cc83057"></a>
+int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
+<tr class="separator:ad397d1dfbb62c7b612baeebe8cc83057"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ab54b59df8e4d8f2bd1eed7c478ac6756" id="r_ab54b59df8e4d8f2bd1eed7c478ac6756"><td class="memItemLeft" align="right" valign="top"><a id="ab54b59df8e4d8f2bd1eed7c478ac6756" name="ab54b59df8e4d8f2bd1eed7c478ac6756"></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; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
+<tr class="separator:ab54b59df8e4d8f2bd1eed7c478ac6756"><td class="memSeparator" colspan="2">&#160;</td></tr>
+</table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock"><p>Class that represents a directed graph and provides methods for manipulating the graph. </p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a id="a75a849f80a66304e7da39b3ccd6129d6" name="a75a849f80a66304e7da39b3ccd6129d6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a75a849f80a66304e7da39b3ccd6129d6">&#9670;&#160;</a></span>Graph()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">graph::topological_sort::Graph::Graph </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>nodes</em></span></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Constructor for the <a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html" title="Class that represents a directed graph and provides methods for manipulating the graph.">Graph</a> class. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramname">nodes</td><td>Number of nodes in the graph </td></tr>
+  </table>
+  </dd>
+</dl>
+<div class="fragment"><div class="line"><span class="lineno">   48</span>: n(nodes), adj(nodes) {}</div>
+</div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Function Documentation</h2>
+<a id="a57036210706a45b9363563252393a345" name="a57036210706a45b9363563252393a345"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a57036210706a45b9363563252393a345">&#9670;&#160;</a></span>addEdge()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">void graph::topological_sort::Graph::addEdge </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>u</em></span>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Function that adds an edge between two nodes or vertices of graph. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramname">u</td><td>Start node of the edge </td></tr>
+    <tr><td class="paramname">v</td><td>End node of the edge </td></tr>
+  </table>
+  </dd>
+</dl>
+<div class="fragment"><div class="line"><span class="lineno">   55</span>{ adj[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v); }</div>
+<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></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="../../d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg" width="366" 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="a5e84b175ef768ff58eaeededd43e8368" name="a5e84b175ef768ff58eaeededd43e8368"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5e84b175ef768ff58eaeededd43e8368">&#9670;&#160;</a></span>getAdjacencyList()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">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; int &gt; &gt; &amp; graph::topological_sort::Graph::getAdjacencyList </td>
+          <td>(</td>
+          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
+          <td> const</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Get the adjacency list of the graph. </p>
+<dl class="section return"><dt>Returns</dt><dd>A reference to the adjacency list </dd></dl>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>                                                              {</div>
+<div class="line"><span class="lineno">   62</span>        <span class="keywordflow">return</span> adj;</div>
+<div class="line"><span class="lineno">   63</span>    }</div>
+</div><!-- fragment -->
+</div>
+</div>
+<a id="ad22018e4f4f80aecb0538044bb83d096" name="ad22018e4f4f80aecb0538044bb83d096"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad22018e4f4f80aecb0538044bb83d096">&#9670;&#160;</a></span>getNumNodes()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int graph::topological_sort::Graph::getNumNodes </td>
+          <td>(</td>
+          <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
+          <td> const</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Get the number of nodes in the graph. </p>
+<dl class="section return"><dt>Returns</dt><dd>The number of nodes </dd></dl>
+<div class="fragment"><div class="line"><span class="lineno">   69</span>{ <span class="keywordflow">return</span> n; }</div>
+</div><!-- fragment -->
+</div>
+</div>
+<hr/>The documentation for this class was generated from the following file:<ul>
+<li>graph/<a class="el" href="../../d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></li>
+</ul>
+</div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></li><li class="navelem"><b>topological_sort</b></li><li class="navelem"><a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</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.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph.js
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph.js
@@ -0,0 +1,7 @@
+var classgraph_1_1topological__sort_1_1_graph =
+[
+    [ "Graph", "d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6", null ],
+    [ "addEdge", "d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345", null ],
+    [ "getAdjacencyList", "d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368", null ],
+    [ "getNumNodes", "d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096", null ]
+];
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map
@@ -0,0 +1,5 @@
+<map id="graph::topological_sort::Graph::addEdge" name="graph::topological_sort::Graph::addEdge">
+<area shape="rect" id="Node000001" title="Function that adds an edge between two nodes or vertices of graph." alt="" coords="5,5,158,46"/>
+<area shape="rect" id="Node000002" 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="206,13,360,38"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,23,190,23,190,28,158,28"/>
+</map>
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5
@@ -0,0 +1 @@
+1b7f4d729ecbe66b97fdd869ae62df4d
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg
@@ -0,0 +1,66 @@
+<?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 12.1.2 (20240928.0832)
+ -->
+<!-- Title: graph::topological_sort::Graph::addEdge Pages: 1 -->
+<svg width="274pt" height="39pt"
+ viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+
+<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
+
+<style type="text/css"><![CDATA[
+.node, .edge {opacity: 0.7;}
+.node.selected, .edge.selected {opacity: 1;}
+.edge:hover path { stroke: red; }
+.edge:hover polygon { stroke: red; fill: red; }
+]]></style>
+<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
+<svg id="graph" class="graph">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
+<title>graph::topological_sort::Graph::addEdge</title>
+<!-- Node1 -->
+<g id="Node000001" class="node">
+<title>Node1</title>
+<g id="a_Node000001"><a xlink:title="Function that adds an edge between two nodes or vertices of graph.">
+<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
+<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="Node000002" class="node">
+<title>Node2</title>
+<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="266,-24.88 150.25,-24.88 150.25,-5.63 266,-5.63 266,-24.88"/>
+<text text-anchor="middle" x="208.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<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="M114.46,-15.25C122.41,-15.25 130.66,-15.25 138.81,-15.25"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-18.75 148.71,-15.25 138.71,-11.75 138.71,-18.75"/>
+</a>
+</g>
+</g>
+</g>
+</svg>
+</svg>
+
+<style type='text/css'>
+<![CDATA[
+[data-mouse-over-selected='false'] { opacity: 0.7; }
+[data-mouse-over-selected='true']  { opacity: 1.0; }
+]]>
+</style>
+<script type="application/ecmascript"><![CDATA[
+document.addEventListener('DOMContentLoaded', (event) => {
+  highlightEdges();
+  highlightAdjacentNodes();
+});
+]]></script>
+</svg>
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg
@@ -0,0 +1,40 @@
+<?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 12.1.2 (20240928.0832)
+ -->
+<!-- Title: graph::topological_sort::Graph::addEdge Pages: 1 -->
+<svg width="274pt" height="39pt"
+ viewBox="0.00 0.00 274.00 38.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 34.5)">
+<title>graph::topological_sort::Graph::addEdge</title>
+<!-- Node1 -->
+<g id="Node000001" class="node">
+<title>Node1</title>
+<g id="a_Node000001"><a xlink:title="Function that adds an edge between two nodes or vertices of graph.">
+<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
+<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="Node000002" class="node">
+<title>Node2</title>
+<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="266,-24.88 150.25,-24.88 150.25,-5.63 266,-5.63 266,-24.88"/>
+<text text-anchor="middle" x="208.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<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="M114.46,-15.25C122.41,-15.25 130.66,-15.25 138.81,-15.25"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-18.75 148.71,-15.25 138.71,-11.75 138.71,-18.75"/>
+</a>
+</g>
+</g>
+</g>
+</svg>