mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-29 04:53:55 +08:00
Documentation for ecb8a3388d
This commit is contained in:
realstealthninja
271
de/df6/classgreedy__algorithms_1_1_binary_addition.html
Normal file
271
de/df6/classgreedy__algorithms_1_1_binary_addition.html
Normal file
@@ -0,0 +1,271 @@
|
||||
<!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++: greedy_algorithms::BinaryAddition 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"> 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&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&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&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&dn=expat.txt MIT */
|
||||
$(function(){initNavTree('de/df6/classgreedy__algorithms_1_1_binary_addition.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> |
|
||||
<a href="#pri-methods">Private Member Functions</a> |
|
||||
<a href="../../d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html">List of all members</a> </div>
|
||||
<div class="headertitle"><div class="title">greedy_algorithms::BinaryAddition Class Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>A class to perform binary addition of two binary strings.
|
||||
<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:a801fd1ec5cda76b0bb82cbf23ed4d527" id="r_a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &b)</td></tr>
|
||||
<tr class="memdesc:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="mdescLeft"> </td><td class="mdescRight">Adds two binary strings and returns the result as a binary string. <br /></td></tr>
|
||||
<tr class="separator:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
|
||||
Private Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a4cfb595ba80795a9efae0e3f6f5c34d2" id="r_a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str) const</td></tr>
|
||||
<tr class="memdesc:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="mdescLeft"> </td><td class="mdescRight">Validates whether a string contains only binary characters (0 or 1). <br /></td></tr>
|
||||
<tr class="separator:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>A class to perform binary addition of two binary strings. </p>
|
||||
</div><h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a801fd1ec5cda76b0bb82cbf23ed4d527" name="a801fd1ec5cda76b0bb82cbf23ed4d527"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a801fd1ec5cda76b0bb82cbf23ed4d527">◆ </a></span>addBinary()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> greedy_algorithms::BinaryAddition::addBinary </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <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>a</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &</td> <td class="paramname"><span class="paramname"><em>b</em></span> )</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>Adds two binary strings and returns the result as a binary string. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">a</td><td>The first binary string. </td></tr>
|
||||
<tr><td class="paramname">b</td><td>The second binary string. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>The sum of the two binary strings as a binary string, or an empty string if either input string contains non-binary characters. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(a) || !<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(b)) {</div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> <span class="stringliteral">""</span>; <span class="comment">// Return empty string if input contains non-binary</span></div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="comment">// characters</span></div>
|
||||
<div class="line"><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><span class="lineno"> 45</span> </div>
|
||||
<div class="line"><span class="lineno"> 46</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordtype">int</span> carry = 0;</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordtype">int</span> maxLength = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(a.size(), b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
|
||||
<div class="line"><span class="lineno"> 49</span> </div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="comment">// Traverse both strings from the end to the beginning</span></div>
|
||||
<div class="line"><span class="lineno"> 51</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < maxLength; ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 52</span> <span class="comment">// Get the current bits from both strings, if available</span></div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keywordtype">int</span> bitA = (i < a.size()) ? (a[a.size() - 1 - i] - <span class="charliteral">'0'</span>) : 0;</div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">int</span> bitB = (i < b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) ? (b[b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1 - i] - <span class="charliteral">'0'</span>) : 0;</div>
|
||||
<div class="line"><span class="lineno"> 55</span> </div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="comment">// Calculate the sum of bits and carry</span></div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = bitA + bitB + carry;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> carry = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> / 2; <span class="comment">// Determine the carry for the next bit</span></div>
|
||||
<div class="line"><span class="lineno"> 59</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back((sum % 2) +</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="charliteral">'0'</span>); <span class="comment">// Append the sum's current bit to result</span></div>
|
||||
<div class="line"><span class="lineno"> 61</span> }</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (carry) {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(<span class="charliteral">'1'</span>);</div>
|
||||
<div class="line"><span class="lineno"> 64</span> }</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
||||
<div class="line"><span class="lineno"> 67</span> }</div>
|
||||
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
|
||||
<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a4cfb595ba80795a9efae0e3f6f5c34d2"><div class="ttname"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition::isValidBinaryString</a></div><div class="ttdeci">bool isValidBinaryString(const std::string &str) const</div><div class="ttdoc">Validates whether a string contains only binary characters (0 or 1).</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:75</div></div>
|
||||
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</div></div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T > > &A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
|
||||
<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(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><!-- 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="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg" width="586" height="250"><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="a4cfb595ba80795a9efae0e3f6f5c34d2" name="a4cfb595ba80795a9efae0e3f6f5c34d2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">◆ </a></span>isValidBinaryString()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool greedy_algorithms::BinaryAddition::isValidBinaryString </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <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>str</em></span></td><td>)</td>
|
||||
<td> const</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Validates whether a string contains only binary characters (0 or 1). </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>The string to validate. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true if the string is binary, false otherwise. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(),</div>
|
||||
<div class="line"><span class="lineno"> 77</span> [](<span class="keywordtype">char</span> c) { return c == <span class="stringliteral">'0'</span> || c == <span class="stringliteral">'1'</span>; });</div>
|
||||
<div class="line"><span class="lineno"> 78</span> }</div>
|
||||
<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
|
||||
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(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="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg" width="366" height="135"><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>greedy_algorithms/<a class="el" href="../../d9/d1f/binary__addition_8cpp.html">binary_addition.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="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</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>
|
||||
5
de/df6/classgreedy__algorithms_1_1_binary_addition.js
Normal file
5
de/df6/classgreedy__algorithms_1_1_binary_addition.js
Normal file
@@ -0,0 +1,5 @@
|
||||
var classgreedy__algorithms_1_1_binary_addition =
|
||||
[
|
||||
[ "addBinary", "de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527", null ],
|
||||
[ "isValidBinaryString", "de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2", null ]
|
||||
];
|
||||
@@ -0,0 +1,9 @@
|
||||
<map id="greedy_algorithms::BinaryAddition::isValidBinaryString" name="greedy_algorithms::BinaryAddition::isValidBinaryString">
|
||||
<area shape="rect" id="Node000001" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="5,40,194,95"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="262,5,340,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,42,246,29,247,34,194,47"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="242,55,360,80"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="194,65,226,65,226,70,194,70"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="247,104,355,130"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="194,88,232,97,231,102,193,93"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
b34b8fba06083b003abe8695e93bcb7a
|
||||
@@ -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: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
|
||||
<svg width="274pt" height="101pt"
|
||||
viewBox="0.00 0.00 274.00 101.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 97.25)">
|
||||
<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
|
||||
<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
|
||||
<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
|
||||
<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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/algorithm/all_any_none_of.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
|
||||
</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/string/basic_string/begin.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.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/string/basic_string/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
|
||||
</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>
|
||||
|
After Width: | Height: | Size: 4.5 KiB |
@@ -0,0 +1,77 @@
|
||||
<?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: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
|
||||
<svg width="274pt" height="101pt"
|
||||
viewBox="0.00 0.00 274.00 101.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 97.25)">
|
||||
<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
|
||||
<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
|
||||
<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
|
||||
<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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/algorithm/all_any_none_of.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
|
||||
</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/string/basic_string/begin.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.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/string/basic_string/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
|
||||
<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.7 KiB |
@@ -0,0 +1,17 @@
|
||||
<map id="greedy_algorithms::BinaryAddition::addBinary" name="greedy_algorithms::BinaryAddition::addBinary">
|
||||
<area shape="rect" id="Node000001" title="Adds two binary strings and returns the result as a binary string." alt="" coords="5,138,177,178"/>
|
||||
<area shape="rect" id="Node000002" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="225,40,413,95"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,135,232,99,234,104,145,140"/>
|
||||
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="283,120,355,146"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="177,146,267,136,267,141,177,151"/>
|
||||
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="274,169,364,195"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="177,165,258,173,258,178,177,170"/>
|
||||
<area shape="rect" id="Node000008" 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="263,219,374,244"/>
|
||||
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="146,177,225,205,249,212,248,217,224,210,144,182"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="481,5,559,31"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="412,42,465,29,466,34,414,47"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="461,55,579,80"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="413,65,445,65,445,70,413,70"/>
|
||||
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="466,104,574,130"/>
|
||||
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="414,88,451,97,450,102,412,93"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
eb89941a3eefeca41e9f80419516c8b8
|
||||
@@ -0,0 +1,176 @@
|
||||
<?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: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
|
||||
<svg width="439pt" height="187pt"
|
||||
viewBox="0.00 0.00 438.50 187.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 183.25)">
|
||||
<title>greedy_algorithms::BinaryAddition::addBinary</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
|
||||
<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
|
||||
<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
|
||||
<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
|
||||
</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/algorithm/all_any_none_of.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
|
||||
</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/string/basic_string/begin.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
|
||||
</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/string/basic_string/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
|
||||
</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>
|
||||
|
After Width: | Height: | Size: 8.1 KiB |
@@ -0,0 +1,150 @@
|
||||
<?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: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
|
||||
<svg width="439pt" height="187pt"
|
||||
viewBox="0.00 0.00 438.50 187.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 183.25)">
|
||||
<title>greedy_algorithms::BinaryAddition::addBinary</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
|
||||
<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
|
||||
<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
|
||||
<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
|
||||
<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="Node000008" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
|
||||
<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge7_Node000001_Node000008" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
|
||||
</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/algorithm/all_any_none_of.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
|
||||
</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/string/basic_string/begin.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
|
||||
</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/string/basic_string/end.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
|
||||
<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 7.3 KiB |
Reference in New Issue
Block a user