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

Documentation for 5eff2b9e2b

Browse Source
This commit is contained in:
realstealthninja
2024-10-10 14:30:39 +00:00
parent a4e0db5273
commit 16c1e187bd
237 changed files with 3109 additions and 1269 deletions
Download Patch File Download Diff File Expand all files Collapse all files

225
da/d21/class_longest___substring.html Normal file
View File

@@ -0,0 +1,225 @@
<!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++: Longest_Substring 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('da/d21/class_longest___substring.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="../../d3/d9c/class_longest___substring-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">Longest_Substring Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Class that solves the Longest Substring Without Repeating Characters problem.
<a href="#details">More...</a></p>
<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:af8a3672bc8d95e7da4f9a45e5e2e387d" id="r_af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s)</td></tr>
<tr class="memdesc:af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to find the length of the longest substring without repeating characters. <br /></td></tr>
<tr class="separator:af8a3672bc8d95e7da4f9a45e5e2e387d"><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 solves the Longest Substring Without Repeating Characters problem. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="af8a3672bc8d95e7da4f9a45e5e2e387d" name="af8a3672bc8d95e7da4f9a45e5e2e387d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af8a3672bc8d95e7da4f9a45e5e2e387d">&#9670;&#160;</a></span>lengthOfLongestSubstring()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int Longest_Substring::lengthOfLongestSubstring </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td> <td class="paramname"><span class="paramname"><em>s</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>Function to find the length of the longest substring without repeating characters. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">s</td><td>Input string. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Length of the longest substring. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 44</span> {</div>
<div class="line"><span class="lineno"> 45</span> <span class="comment">// If the size of string is 1, then it will be the answer.</span></div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() == 1) <span class="keywordflow">return</span> 1;</div>
<div class="line"><span class="lineno"> 47</span> </div>
<div class="line"><span class="lineno"> 48</span> <span class="comment">// Map used to store the character frequency.</span></div>
<div class="line"><span class="lineno"> 49</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a> m;</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordtype">int</span> n = s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
<div class="line"><span class="lineno"> 51</span> </div>
<div class="line"><span class="lineno"> 52</span> <span class="comment">// Deque to remove from back if repeating characters are present.</span></div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque&lt;char&gt;</a> temp;</div>
<div class="line"><span class="lineno"> 54</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque&lt;char&gt;</a> res;</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">int</span> i, j;</div>
<div class="line"><span class="lineno"> 56</span> </div>
<div class="line"><span class="lineno"> 57</span> <span class="comment">// Sliding window approach using two pointers.</span></div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">for</span> (i = 0, j = 0; i &lt; n &amp;&amp; j &lt; n;) {</div>
<div class="line"><span class="lineno"> 59</span> m[s[j]]++;</div>
<div class="line"><span class="lineno"> 60</span> </div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// If repeating character found, update result and remove from the front.</span></div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (m[s[j]] &gt; 1) {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>() &gt; res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>()) {</div>
<div class="line"><span class="lineno"> 64</span> res = temp;</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> </div>
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">while</span> (m[s[j]] &gt; 1) {</div>
<div class="line"><span class="lineno"> 68</span> temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html">pop_front</a>();</div>
<div class="line"><span class="lineno"> 69</span> m[s[i]]--;</div>
<div class="line"><span class="lineno"> 70</span> i++;</div>
<div class="line"><span class="lineno"> 71</span> }</div>
<div class="line"><span class="lineno"> 72</span> }</div>
<div class="line"><span class="lineno"> 73</span> </div>
<div class="line"><span class="lineno"> 74</span> <span class="comment">// Add the current character to the deque.</span></div>
<div class="line"><span class="lineno"> 75</span> temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/push_back.html">push_back</a>(s[j]);</div>
<div class="line"><span class="lineno"> 76</span> j++;</div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> </div>
<div class="line"><span class="lineno"> 79</span> <span class="comment">// Final check to update result.</span></div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>() &gt; res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>()) {</div>
<div class="line"><span class="lineno"> 81</span> res = temp;</div>
<div class="line"><span class="lineno"> 82</span> }</div>
<div class="line"><span class="lineno"> 83</span> </div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>(); <span class="comment">// Return the length of the longest substring.</span></div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="ttc" id="adeque_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque</a></div></div>
<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html">std::deque::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque/push_back.html">std::deque::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></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="../../da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg" width="384" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>others/<a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html">longest_substring_without_repeating_characters.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="../../da/d21/class_longest___substring.html">Longest_Substring</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>

4
da/d21/class_longest___substring.js Normal file
View File

@@ -0,0 +1,4 @@
var class_longest___substring =
[
[ "lengthOfLongestSubstring", "da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d", null ]
];

12
da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map Normal file
View File

@@ -0,0 +1,12 @@
<map id="Longest_Substring::lengthOfLongestSubstring" name="Longest_Substring::lengthOfLongestSubstring">
<area shape="rect" id="Node000001" title="Function to find the length of the longest substring without repeating characters." alt="" coords="5,47,177,88"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="240,5,362,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,54,256,33,257,39,177,59"/>
<area shape="poly" id="edge5_Node000001_Node000002" title=" " alt="" coords="146,44,224,25,225,30,148,49"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/pop_front.html#" title=" " alt="" coords="229,55,374,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="177,65,214,65,214,70,177,70"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/push_back.html#" title=" " alt="" coords="225,104,378,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="177,85,229,97,228,102,176,90"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/size.html#" title=" " alt="" coords="244,153,358,179"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="126,86,173,113,226,140,240,145,238,150,224,145,170,118,124,91"/>
</map>

1
da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
5ded94fdecb46e5c02f228d958402fa6

129
da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg Normal file
View File

@@ -0,0 +1,129 @@
<?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: Longest_Substring::lengthOfLongestSubstring Pages: 1 -->
<svg width="288pt" height="138pt"
viewBox="0.00 0.00 287.50 138.25" 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 134.25)">
<title>Longest_Substring::lengthOfLongestSubstring</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to find the length of the longest substring without repeating characters.">
<polygon fill="#999999" stroke="#666666" points="128.5,-98.88 0,-98.88 0,-68.38 128.5,-68.38 128.5,-98.88"/>
<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
<text text-anchor="middle" x="64.25" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</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/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="267.88,-130.25 176.12,-130.25 176.12,-111 267.88,-111 267.88,-130.25"/>
<text text-anchor="middle" x="222" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</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="M128.6,-92.03C149.19,-96.62 171.18,-102.19 188.54,-107.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.19,-110.56 197.77,-110.15 189.25,-103.87 187.19,-110.56"/>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge5_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge5_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.17,-99.37C124.03,-104.37 145.26,-109.58 164.58,-113.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.71,-117.13 174.21,-115.75 165.14,-110.28 163.71,-117.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276.12,-93.25 167.88,-93.25 167.88,-74 276.12,-74 276.12,-93.25"/>
<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<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="M128.6,-83.62C137.72,-83.62 147.11,-83.62 156.26,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.16,-87.13 166.16,-83.63 156.16,-80.13 156.16,-87.13"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="279.5,-56.25 164.5,-56.25 164.5,-37 279.5,-37 279.5,-56.25"/>
<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M128.6,-68.58C141.5,-65.51 154.94,-62.32 167.46,-59.34"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.25,-62.75 177.17,-57.04 166.64,-55.94 168.25,-62.75"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="264.88,-19.25 179.12,-19.25 179.12,0 264.88,0 264.88,-19.25"/>
<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M89.81,-67.89C109.46,-55.76 138.02,-39.17 164.5,-27.62 167.85,-26.16 171.36,-24.76 174.91,-23.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.93,-26.79 184.2,-20.17 173.6,-20.18 175.93,-26.79"/>
</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>
Side by Side

After

Width:  |  Height:  |  Size: 5.6 KiB

103
da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,103 @@
<?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: Longest_Substring::lengthOfLongestSubstring Pages: 1 -->
<svg width="288pt" height="138pt"
viewBox="0.00 0.00 287.50 138.25" 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 134.25)">
<title>Longest_Substring::lengthOfLongestSubstring</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Function to find the length of the longest substring without repeating characters.">
<polygon fill="#999999" stroke="#666666" points="128.5,-98.88 0,-98.88 0,-68.38 128.5,-68.38 128.5,-98.88"/>
<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
<text text-anchor="middle" x="64.25" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</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/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="267.88,-130.25 176.12,-130.25 176.12,-111 267.88,-111 267.88,-130.25"/>
<text text-anchor="middle" x="222" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</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="M128.6,-92.03C149.19,-96.62 171.18,-102.19 188.54,-107.31"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="187.19,-110.56 197.77,-110.15 189.25,-103.87 187.19,-110.56"/>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge5_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge5_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M106.17,-99.37C124.03,-104.37 145.26,-109.58 164.58,-113.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.71,-117.13 174.21,-115.75 165.14,-110.28 163.71,-117.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276.12,-93.25 167.88,-93.25 167.88,-74 276.12,-74 276.12,-93.25"/>
<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<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="M128.6,-83.62C137.72,-83.62 147.11,-83.62 156.26,-83.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="156.16,-87.13 166.16,-83.63 156.16,-80.13 156.16,-87.13"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="279.5,-56.25 164.5,-56.25 164.5,-37 279.5,-37 279.5,-56.25"/>
<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M128.6,-68.58C141.5,-65.51 154.94,-62.32 167.46,-59.34"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="168.25,-62.75 177.17,-57.04 166.64,-55.94 168.25,-62.75"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="264.88,-19.25 179.12,-19.25 179.12,0 264.88,0 264.88,-19.25"/>
<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M89.81,-67.89C109.46,-55.76 138.02,-39.17 164.5,-27.62 167.85,-26.16 171.36,-24.76 174.91,-23.43"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.93,-26.79 184.2,-20.17 173.6,-20.18 175.93,-26.79"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.9 KiB