backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for ea76786f12

Browse Source
This commit is contained in:
github-actions
2021-11-14 17:05:21 +00:00
parent 495131a679
commit 2eab8d4d28
236 changed files with 1957 additions and 1343 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
annotated.html
View File

@@ -123,10 +123,12 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm </td></tr>
<tr id="row_2_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">Geometry algorithms </td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_3_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>grahamscan</b></td><td class="desc"></td></tr>
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_1_" class="arrow" onclick="toggleFolder('3_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
<tr id="row_3_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_3_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dce/namespacegraph.html" target="_self">graph</a></td><td class="desc"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </td></tr>
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_4_0_" class="arrow" onclick="toggleFolder('4_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>is_graph_bipartite</b></td><td class="desc"></td></tr>
<tr id="row_4_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
@@ -200,8 +202,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_16_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>

5
annotated_dup.js
View File

@@ -39,6 +39,9 @@ var annotated_dup =
[ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ]
] ],
[ "geometry", "d5/d5f/namespacegeometry.html", [
[ "grahamscan", null, [
[ "Point", "d7/d48/structgeometry_1_1grahamscan_1_1_point.html", null ]
] ],
[ "jarvis", null, [
[ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ],
[ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ]
@@ -141,8 +144,8 @@ var annotated_dup =
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],

4
classes.html
View File

@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d9/dde/classbinary__search__tree.html">binary_search_tree</a></dd><dd><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></dd><dd><a class="el" href="d9/d90/struct_btree.html">Btree</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_C" name="letter_C">C</a></dt>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
@@ -133,7 +133,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_Q" name="letter_Q">Q</a></dt>
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>

110
d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html Normal file
View File

@@ -0,0 +1,110 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#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.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d7/d48/structgeometry_1_1grahamscan_1_1_point.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">geometry::grahamscan::Point Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>x</b> (defined in <a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a>)</td><td class="entry"><a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>y</b> (defined in <a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a>)</td><td class="entry"><a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
</ul>
</div>
</body>
</html>

2
d4/d8d/jarvis__algorithm_8cpp.html
View File

@@ -120,7 +120,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:d5/d5f/namespacegeometry"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d5f/namespacegeometry.html">geometry</a></td></tr>
<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft">&#160;</td><td class="mdescRight">Geometry algorithms. <br /></td></tr>
<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d5/da7/namespacejarvis"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da7/namespacejarvis.html">jarvis</a></td></tr>
<tr class="memdesc:d5/da7/namespacejarvis"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. <br /></td></tr>

6
d5/d5f/namespacegeometry.html
View File

@@ -94,10 +94,12 @@ $(document).ready(function(){initNavTree('d5/d5f/namespacegeometry.html','../../
</div><!--header-->
<div class="contents">
<p>Geometry algorithms.
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
<a href="../../d5/d5f/namespacegeometry.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Geometry algorithms. </p>
<div class="textblock"><p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p >Geometry algorithms.</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> for mathematics and datatype conversion for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

3
d5/d5f/namespacegeometry.js
View File

@@ -1,5 +1,8 @@
var namespacegeometry =
[
[ "grahamscan", null, [
[ "Point", "d7/d48/structgeometry_1_1grahamscan_1_1_point.html", null ]
] ],
[ "jarvis", null, [
[ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ],
[ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ]

2
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -219,6 +219,8 @@ Dynamic Programming</h1>
<h1><a class="anchor" id="autotoc_md50"></a>
Geometry</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/graham_scan_algorithm.cpp" target="_blank">Graham Scan Algorithm</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/graham_scan_functions.hpp" target="_blank">Graham Scan Functions</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/jarvis_algorithm.cpp" target="_blank">Jarvis Algorithm</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp" target="_blank">Line Segment Intersection</a></li>
</ul>

122
d7/d48/structgeometry_1_1grahamscan_1_1_point.html Normal file
View File

@@ -0,0 +1,122 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: geometry::grahamscan::Point Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#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.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d7/d48/structgeometry_1_1grahamscan_1_1_point.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="../../d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">geometry::grahamscan::Point Struct Reference</div></div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:acfa2c929b3637a69ffa51fa6e2c9476b"><td class="memItemLeft" align="right" valign="top"><a id="acfa2c929b3637a69ffa51fa6e2c9476b" name="acfa2c929b3637a69ffa51fa6e2c9476b"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
<tr class="separator:acfa2c929b3637a69ffa51fa6e2c9476b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6905580704aa56167ba6ff886289d5f7"><td class="memItemLeft" align="right" valign="top"><a id="a6905580704aa56167ba6ff886289d5f7" name="a6905580704aa56167ba6ff886289d5f7"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
<tr class="separator:a6905580704aa56167ba6ff886289d5f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<hr/>The documentation for this struct was generated from the following file:<ul>
<li>geometry/<a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html">graham_scan_functions.hpp</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="../../d5/d5f/namespacegeometry.html">geometry</a></li><li class="navelem"><b>grahamscan</b></li><li class="navelem"><a class="el" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
</ul>
</div>
</body>
</html>

332
de/d89/graham__scan__functions_8hpp_source.html Normal file
View File

@@ -0,0 +1,332 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: geometry/graham_scan_functions.hpp Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#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.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">graham_scan_functions.hpp</div></div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment"> * @file</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment"> * @brief Implementation of the [Convex</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment"> * Hull](https://en.wikipedia.org/wiki/Convex_hull) implementation using [Graham</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment"> * Scan](https://en.wikipedia.org/wiki/Graham_scan)</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment"> * @details</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment"> * In geometry, the convex hull or convex envelope or convex closure of a shape</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment"> * is the smallest convex set that contains it. The convex hull may be defined</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment"> * either as the intersection of all convex sets containing a given subset of a</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment"> * Euclidean space, or equivalently as the set of all convex combinations of</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment"> * points in the subset. For a bounded subset of the plane, the convex hull may</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment"> * be visualized as the shape enclosed by a rubber band stretched around the</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span><span class="comment"> * subset.</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment"> *</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment"> * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment"> * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment"> *</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="comment"> * ### Implementation</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="comment"> *</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="comment"> * Sort points</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="comment"> * We first find the bottom-most point. The idea is to pre-process</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="comment"> * points be sorting them with respect to the bottom-most point. Once the points</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="comment"> * are sorted, they form a simple closed path.</span></div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="comment"> * The sorting criteria is to use the orientation to compare angles without</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="comment"> * actually computing them (See the compare() function below) because</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="comment"> * computation of actual angles would be inefficient since trigonometric</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment"> * functions are not simple to evaluate.</span></div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment"> *</span></div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment"> * Accept or Reject Points</span></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment"> * Once we have the closed path, the next step is to traverse the path and</span></div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment"> * remove concave points on this path using orientation. The first two points in</span></div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment"> * sorted array are always part of Convex Hull. For remaining points, we keep</span></div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment"> * track of recent three points, and find the angle formed by them. Let the</span></div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment"> * three points be prev(p), curr(c) and next(n). If orientation of these points</span></div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment"> * (considering them in same order) is not counterclockwise, we discard c,</span></div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment"> * otherwise we keep it.</span></div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment"> *</span></div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment"> *</span></div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="preprocessor">#include &lt;algorithm&gt;</span> <span class="comment">/// for std::swap</span></div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#include &lt;cstdlib&gt;</span> <span class="comment">/// for mathematics and datatype conversion</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">/// for IO operations</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#include &lt;stack&gt;</span> <span class="comment">/// for std::stack</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="preprocessor">#include &lt;vector&gt;</span> <span class="comment">/// for std::vector</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> </div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment"> * @namespace geometry</span></div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment"> * @brief geometric algorithms</span></div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d5/d5f/namespacegeometry.html"> 51</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d5f/namespacegeometry.html">geometry</a> {</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment"> * @namespace graham scan</span></div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment"> * @brief convex hull algorithm</span></div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="keyword">namespace </span>grahamscan {</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment"> * @struct Point</span></div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment"> * @brief for X and Y co-ordinates of the co-ordinate.</span></div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html"> 63</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> x, y;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span>};</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment">// A global point needed for sorting points with reference</span></div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment">// to the first point Used in compare function of qsort()</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> </div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> p0;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> </div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment"> * @brief A utility function to find next to top in a stack.</span></div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment"> * @param S Stack to be used for the process.</span></div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment"> * @returns @param Point Co-ordinates of the Point &lt;int, int&gt;</span></div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> nextToTop(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Point&gt;</a> *S) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> p = S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> res = S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(p);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> res;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span>}</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> </div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment"> * @brief A utility function to return square of distance between p1 and p2.</span></div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment"> * @param p1 Co-ordinates of Point 1 &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment"> * @param p2 Co-ordinates of Point 2 &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment"> * @returns @param int distance between p1 and p2.</span></div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="keywordtype">int</span> distSq(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p1, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p2) {</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keywordflow">return</span> (p1.x - p2.x) * (p1.x - p2.x) + (p1.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - p2.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) * (p1.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - p2.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>);</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span>}</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> </div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span><span class="comment"> * @brief To find orientation of ordered triplet (p, q, r).</span></div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"> * @param p Co-ordinates of Point p &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> * @param q Co-ordinates of Point q &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"> * @param r Co-ordinates of Point r &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment"> * @returns @param int 0 --&gt; p, q and r are collinear, 1 --&gt; Clockwise,</span></div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment"> * 2 --&gt; Counterclockwise</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="keywordtype">int</span> orientation(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> q, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> r) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordtype">int</span> val = (q.y - p.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) * (r.x - q.x) - (q.x - p.x) * (r.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - q.y);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> </div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keywordflow">if</span> (val == 0) {</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">return</span> 0; <span class="comment">// collinear</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> }</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">return</span> (val &gt; 0) ? 1 : 2; <span class="comment">// clock or counter-clock wise</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span>}</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> </div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment"> * @brief A function used by library function qsort() to sort an array of</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span><span class="comment"> * points with respect to the first point</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span><span class="comment"> * @param vp1 Co-ordinates of Point 1 &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span><span class="comment"> * @param vp2 Co-ordinates of Point 2 &lt;int, int&gt;.</span></div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="comment"> * @returns @param int distance between p1 and p2.</span></div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *vp1, <span class="keyword">const</span> <span class="keywordtype">void</span> *vp2) {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="keyword">auto</span> *p1 = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> *<span class="keyword">&gt;</span>(vp1);</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="keyword">auto</span> *p2 = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span><a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> *<span class="keyword">&gt;</span>(vp2);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// Find orientation</span></div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <span class="keywordtype">int</span> o = orientation(p0, *p1, *p2);</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="keywordflow">if</span> (o == 0) {</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">return</span> (distSq(p0, *p2) &gt;= distSq(p0, *p1)) ? -1 : 1;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> }</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> </div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordflow">return</span> (o == 2) ? -1 : 1;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span>}</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> </div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span><span class="comment">/******************************************************************************</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment"> * @brief Prints convex hull of a set of n points.</span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment"> * @param points vector of Point&lt;int, int&gt; with co-ordinates.</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment"> * @param size Size of the vector.</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment"> * @returns @param vector vector of Conver Hull.</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment"> *******************************************************************************/</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> convexHull(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> points, uint64_t size) {</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// Find the bottom-most point</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordtype">int</span> ymin = points[0].y, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = 0;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size; i++) {</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordtype">int</span> y = points[i].y;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// Pick the bottom-most or chose the left-most point in case of tie</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="keywordflow">if</span> ((y &lt; ymin) || (ymin == y &amp;&amp; points[i].x &lt; points[min].x)) {</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> ymin = points[i].y, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = i;</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> }</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> }</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// Place the bottom-most point at first position</span></div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(points[0], points[min]);</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Sort n-1 points with respect to the first point. A point p1 comes</span></div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="comment">// before p2 in sorted output if p2 has larger polar angle</span></div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> <span class="comment">// (in counterclockwise direction) than p1.</span></div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> p0 = points[0];</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">qsort</a>(&amp;points[1], size - 1, <span class="keyword">sizeof</span>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>);</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// If two or more points make same angle with p0, Remove all but the one</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// that is farthest from p0 Remember that, in above sorting, our criteria</span></div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// was to keep the farthest point at the end when more than one points have</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// same angle.</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordtype">int</span> m = 1; <span class="comment">// Initialize size of modified array</span></div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size; i++) {</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// Keep removing i while angle of i and i+1 is same with respect to p0</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordflow">while</span> (i &lt; size - 1 &amp;&amp; orientation(p0, points[i], points[i + 1]) == 0) {</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> i++;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> }</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> points[m] = points[i];</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> m++; <span class="comment">// Update size of modified array</span></div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> }</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">// If modified array of points has less than 3 points, convex hull is not</span></div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// possible</span></div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">if</span> (m &lt; 3) {</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">return</span> {};</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> };</div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// Create an empty stack and push first three points to it.</span></div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Point&gt;</a> St;</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[0]);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[1]);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[2]);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">// Process remaining n-3 points</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 3; i &lt; m; i++) {</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// Keep removing top while the angle formed by</span></div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// points next-to-top, top, and points[i] makes</span></div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// a non-left turn</span></div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="keywordflow">while</span> (St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/size.html">size</a>() &gt; 1 &amp;&amp;</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> orientation(nextToTop(&amp;St), St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>(), points[i]) != 2) {</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> }</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[i]);</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> }</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> </div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// Now stack has the output points, push them into the resultant vector</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">while</span> (!St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>()) {</div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p = St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(p);</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> }</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> </div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// return resultant vector with Convex Hull co-ordinates.</span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span>}</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span>} <span class="comment">// namespace grahamscan</span></div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span>} <span class="comment">// namespace geometry</span></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/empty.html">std::stack::empty</a></div><div class="ttdeci">T empty(T... args)</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="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition:</b> graham_scan_functions.hpp:51</div></div>
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="aqsort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a></div><div class="ttdeci">T qsort(T... args)</div></div>
<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition:</b> shell_sort2.cpp:87</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/size.html">std::stack::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div>
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:14</div></div>
<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition:</b> huffman.cpp:28</div></div>
<div class="ttc" id="astructgeometry_1_1grahamscan_1_1_point_html"><div class="ttname"><a href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a></div><div class="ttdef"><b>Definition:</b> graham_scan_functions.hpp:63</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --></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="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><b>graham_scan_functions.hpp</b></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.2 </li>
</ul>
</div>
</body>
</html>

1
dir_e3380d2178455503f266746fb14246a5.js
View File

@@ -1,5 +1,6 @@
var dir_e3380d2178455503f266746fb14246a5 =
[
[ "graham_scan_functions.hpp", "de/d89/graham__scan__functions_8hpp_source.html", null ],
[ "jarvis_algorithm.cpp", "d4/d8d/jarvis__algorithm_8cpp.html", "d4/d8d/jarvis__algorithm_8cpp" ],
[ "line_segment_intersection.cpp", "d8/d6c/line__segment__intersection_8cpp.html", "d8/d6c/line__segment__intersection_8cpp" ]
];

5
files.html
View File

@@ -165,8 +165,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_6_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
<tr id="row_6_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="toggleFolder('7_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d89/graham__scan__functions_8hpp_source.html"><span class="icondoc"></span></a><b>graham_scan_functions.hpp</b></td><td class="desc"></td></tr>
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
<tr id="row_7_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_12552d7fa429bf94a2e32e5cf39f7e69.html" target="_self">graph</a></td><td class="desc"></td></tr>
<tr id="row_8_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html" target="_self">bidirectional_dijkstra.cpp</a></td><td class="desc"><a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra" target="_blank">Bidirectional Dijkstra Shortest Path Algorithm</a> </td></tr>
<tr id="row_8_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d82/breadth__first__search_8cpp.html" target="_self">breadth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>

2
globals_func_i.html
View File

@@ -104,8 +104,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>is_happy()&#160;:&#160;<a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
<li>is_prime()&#160;:&#160;<a class="el" href="db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">check_prime.cpp</a></li>
<li>is_square()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
<li>it_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
</ul>
</div><!-- contents -->

2
globals_i.html
View File

@@ -105,9 +105,9 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>is_happy()&#160;:&#160;<a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
<li>is_prime()&#160;:&#160;<a class="el" href="db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">check_prime.cpp</a></li>
<li>is_square()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>isprime&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>it_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
</ul>
</div><!-- contents -->

2
globals_p.html
View File

@@ -105,8 +105,8 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
<li>pop()&#160;:&#160;<a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">paranthesis_matching.cpp</a></li>
<li>power()&#160;:&#160;<a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power_for_huge_numbers.cpp</a>, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">matrix_exponentiation.cpp</a></li>
<li>predict_OLS_regressor()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">ordinary_least_squares_regressor.cpp</a></li>
<li>prime&#160;:&#160;<a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
<li>PRIME&#160;:&#160;<a class="el" href="d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">rabin_karp.cpp</a></li>
<li>prime&#160;:&#160;<a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
<li>prime_factorization()&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization.cpp</a></li>
<li>prime_numbers&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_factorization.cpp</a></li>
<li>primes()&#160;:&#160;<a class="el" href="de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">prime_numbers.cpp</a></li>

83
hierarchy.html
View File

@@ -106,8 +106,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
@@ -160,45 +160,46 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_59_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_70_" class="arrow" onclick="toggleFolder('70_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_70_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_81_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_83_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_83_" class="arrow" onclick="toggleFolder('83_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_83_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_85_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_87_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_89_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_89_" class="arrow" onclick="toggleFolder('89_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_89_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_89_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_89_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_89_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_89_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_89_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_91_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_71_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_71_" class="arrow" onclick="toggleFolder('71_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_71_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_73_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_75_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_77_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_79_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_81_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_83_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_84_" class="arrow" onclick="toggleFolder('84_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_84_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_85_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_87_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_89_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_90_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_90_" class="arrow" onclick="toggleFolder('90_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_90_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_90_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_91_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_93_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
hierarchy.js
View File

@@ -9,8 +9,8 @@ var hierarchy =
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "operations_on_datastructures::circular_linked_list::CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
@@ -64,6 +64,7 @@ var hierarchy =
[ "search::sublist_search::Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", null ],
[ "range_queries::perSegTree", "d8/d28/classrange__queries_1_1per_seg_tree.html", null ],
[ "ciphers::elliptic_curve_key_exchange::Point", "d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html", null ],
[ "geometry::grahamscan::Point", "d7/d48/structgeometry_1_1grahamscan_1_1_point.html", null ],
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],

2
inherit_graph_31.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,195,32"/>
<area shape="rect" id="node1" href="$d7/d48/structgeometry_1_1grahamscan_1_1_point.html" title=" " alt="" coords="5,5,164,47"/>
</map>

2
inherit_graph_31.md5
View File

@@ -1 +1 @@
6940f502400c229af84789c6c00f1735
b4360ed806c1856ef090aefb2d39320e

15
inherit_graph_31.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="150pt" height="28pt"
viewBox="0.00 0.00 150.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="127pt" height="39pt"
viewBox="0.00 0.00 127.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 146,-24 146,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 123,-35 123,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 142,-19.5 142,-0.5 0,-0.5"/>
<text text-anchor="middle" x="71" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
<g id="a_node1"><a xlink:href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 119,-30.5 119,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::grahamscan</text>
<text text-anchor="middle" x="59.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Point</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_32.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="5,5,159,32"/>
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,195,32"/>
</map>

2
inherit_graph_32.md5
View File

@@ -1 +1 @@
595208590648226e9aacf172b391904d
6940f502400c229af84789c6c00f1735

12
inherit_graph_32.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="123pt" height="28pt"
viewBox="0.00 0.00 123.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="150pt" height="28pt"
viewBox="0.00 0.00 150.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 119,-24 119,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 146,-24 146,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 115,-19.5 115,-0.5 0,-0.5"/>
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Point</text>
<g id="a_node1"><a xlink:href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 142,-19.5 142,-0.5 0,-0.5"/>
<text text-anchor="middle" x="71" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_33.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,64,32"/>
<area shape="rect" id="node1" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="5,5,159,32"/>
</map>

2
inherit_graph_33.md5
View File

@@ -1 +1 @@
4eeb1b22e1ab39b25c3d6d16904bf56f
595208590648226e9aacf172b391904d

12
inherit_graph_33.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="52pt" height="28pt"
viewBox="0.00 0.00 52.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="123pt" height="28pt"
viewBox="0.00 0.00 123.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 48,-24 48,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 119,-24 119,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d9a/class_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 44,-19.5 44,-0.5 0,-0.5"/>
<text text-anchor="middle" x="22" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
<g id="a_node1"><a xlink:href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 115,-19.5 115,-0.5 0,-0.5"/>
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Point</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 990 B

After

Width:  |  Height:  |  Size: 1.0 KiB

3
inherit_graph_34.map
View File

@@ -1,4 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,136,32"/>
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="184,5,317,32"/>
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,64,32"/>
</map>

2
inherit_graph_34.md5
View File

@@ -1 +1 @@
6eafaf6d042df9847e0e9a0f31d08595
4eeb1b22e1ab39b25c3d6d16904bf56f

27
inherit_graph_34.svg
View File

@@ -4,34 +4,19 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="242pt" height="28pt"
viewBox="0.00 0.00 242.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="52pt" height="28pt"
viewBox="0.00 0.00 52.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 238,-24 238,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 48,-24 48,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 98,-19.5 98,-0.5 0,-0.5"/>
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph&lt; T &gt;</text>
<g id="a_node1"><a xlink:href="da/d9a/class_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 44,-19.5 44,-0.5 0,-0.5"/>
<text text-anchor="middle" x="22" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="134,-0.5 134,-19.5 234,-19.5 234,-0.5 134,-0.5"/>
<text text-anchor="middle" x="184" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M108.25,-10C116.74,-10 125.42,-10 133.71,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="108.02,-6.5 98.02,-10 108.02,-13.5 108.02,-6.5"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 990 B

3
inherit_graph_35.map
View File

@@ -1,3 +1,4 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d69/classgraph_1_1_h_k_graph.html" title="Represents Bipartite graph for Hopcroft Karp implementation." alt="" coords="5,5,124,32"/>
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,136,32"/>
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="184,5,317,32"/>
</map>

2
inherit_graph_35.md5
View File

@@ -1 +1 @@
30974a2267f7342480d9da8515eba7fd
6eafaf6d042df9847e0e9a0f31d08595

27
inherit_graph_35.svg
View File

@@ -4,19 +4,34 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="97pt" height="28pt"
viewBox="0.00 0.00 97.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="242pt" height="28pt"
viewBox="0.00 0.00 242.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 93,-24 93,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 238,-24 238,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d69/classgraph_1_1_h_k_graph.html" target="_top" xlink:title="Represents Bipartite graph for Hopcroft Karp implementation.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 89,-19.5 89,-0.5 0,-0.5"/>
<text text-anchor="middle" x="44.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph</text>
<g id="a_node1"><a xlink:href="dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 98,-19.5 98,-0.5 0,-0.5"/>
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="134,-0.5 134,-19.5 234,-19.5 234,-0.5 134,-0.5"/>
<text text-anchor="middle" x="184" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M108.25,-10C116.74,-10 125.42,-10 133.71,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="108.02,-6.5 98.02,-10 108.02,-13.5 108.02,-6.5"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
inherit_graph_36.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" title="Class for representing graph as an adjacency list." alt="" coords="5,5,175,47"/>
<area shape="rect" id="node1" href="$d8/d69/classgraph_1_1_h_k_graph.html" title="Represents Bipartite graph for Hopcroft Karp implementation." alt="" coords="5,5,124,32"/>
</map>

2
inherit_graph_36.md5
View File

@@ -1 +1 @@
caa13fcf076ba3470984229bfbfdc7c1
30974a2267f7342480d9da8515eba7fd

15
inherit_graph_36.svg
View File

@@ -4,18 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="135pt" height="39pt"
viewBox="0.00 0.00 135.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<svg width="97pt" height="28pt"
viewBox="0.00 0.00 97.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 131,-35 131,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 93,-24 93,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_top" xlink:title="Class for representing graph as an adjacency list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 127,-30.5 127,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
<text text-anchor="middle" x="63.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
<g id="a_node1"><a xlink:href="d8/d69/classgraph_1_1_h_k_graph.html" target="_top" xlink:title="Represents Bipartite graph for Hopcroft Karp implementation.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 89,-19.5 89,-0.5 0,-0.5"/>
<text text-anchor="middle" x="44.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_37.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html" title=" " alt="" coords="5,5,217,32"/>
<area shape="rect" id="node1" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" title="Class for representing graph as an adjacency list." alt="" coords="5,5,175,47"/>
</map>

2
inherit_graph_37.md5
View File

@@ -1 +1 @@
bafb3280f8e20dc1a7424343016b176d
caa13fcf076ba3470984229bfbfdc7c1

15
inherit_graph_37.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="167pt" height="28pt"
viewBox="0.00 0.00 167.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="135pt" height="39pt"
viewBox="0.00 0.00 135.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 163,-24 163,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 131,-35 131,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 159,-19.5 159,-0.5 0,-0.5"/>
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
<g id="a_node1"><a xlink:href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_top" xlink:title="Class for representing graph as an adjacency list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 127,-30.5 127,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
<text text-anchor="middle" x="63.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_38.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,96,32"/>
<area shape="rect" id="node1" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html" title=" " alt="" coords="5,5,217,32"/>
</map>

2
inherit_graph_38.md5
View File

@@ -1 +1 @@
6a0f93ba427d9329d424820da1078327
bafb3280f8e20dc1a7424343016b176d

12
inherit_graph_38.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="76pt" height="28pt"
viewBox="0.00 0.00 76.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="167pt" height="28pt"
viewBox="0.00 0.00 167.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 72,-24 72,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 163,-24 163,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 68,-19.5 68,-0.5 0,-0.5"/>
<text text-anchor="middle" x="34" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
<g id="a_node1"><a xlink:href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 159,-19.5 159,-0.5 0,-0.5"/>
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_39.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,32"/>
<area shape="rect" id="node1" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,96,32"/>
</map>

2
inherit_graph_39.md5
View File

@@ -1 +1 @@
458fe77fc737dff37fe3ca54afe8d9fd
6a0f93ba427d9329d424820da1078327

12
inherit_graph_39.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="44pt" height="28pt"
viewBox="0.00 0.00 44.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="76pt" height="28pt"
viewBox="0.00 0.00 76.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 40,-24 40,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 72,-24 72,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d66/struct_item.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 36,-19.5 36,-0.5 0,-0.5"/>
<text text-anchor="middle" x="18" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Item</text>
<g id="a_node1"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 68,-19.5 68,-0.5 0,-0.5"/>
<text text-anchor="middle" x="34" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 989 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_40.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d82/classlarge__number.html" title=" " alt="" coords="5,5,109,32"/>
<area shape="rect" id="node1" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,32"/>
</map>

2
inherit_graph_40.md5
View File

@@ -1 +1 @@
020117a75ed9e535ed2f6e9057f8e61f
458fe77fc737dff37fe3ca54afe8d9fd

12
inherit_graph_40.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="86pt" height="28pt"
viewBox="0.00 0.00 86.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="44pt" height="28pt"
viewBox="0.00 0.00 44.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 82,-24 82,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 40,-24 40,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d82/classlarge__number.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 78,-19.5 78,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</text>
<g id="a_node1"><a xlink:href="db/d66/struct_item.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 36,-19.5 36,-0.5 0,-0.5"/>
<text text-anchor="middle" x="18" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Item</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1004 B

After

Width:  |  Height:  |  Size: 989 B

2
inherit_graph_41.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d19/structlinear__probing_1_1_entry.html" title=" " alt="" coords="5,5,151,32"/>
<area shape="rect" id="node1" href="$db/d82/classlarge__number.html" title=" " alt="" coords="5,5,109,32"/>
</map>

2
inherit_graph_41.md5
View File

@@ -1 +1 @@
798897e4b583c00fbe8c88f7e5f1551d
020117a75ed9e535ed2f6e9057f8e61f

12
inherit_graph_41.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="117pt" height="28pt"
viewBox="0.00 0.00 117.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="86pt" height="28pt"
viewBox="0.00 0.00 86.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 113,-24 113,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 82,-24 82,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d19/structlinear__probing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 109,-19.5 109,-0.5 0,-0.5"/>
<text text-anchor="middle" x="54.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::Entry</text>
<g id="a_node1"><a xlink:href="db/d82/classlarge__number.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 78,-19.5 78,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1004 B

2
inherit_graph_42.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d0/dff/structlinkedlist.html" title=" " alt="" coords="5,5,79,32"/>
<area shape="rect" id="node1" href="$db/d19/structlinear__probing_1_1_entry.html" title=" " alt="" coords="5,5,151,32"/>
</map>

2
inherit_graph_42.md5
View File

@@ -1 +1 @@
5fc9ec91cf1ed515d3e948f26519c17a
798897e4b583c00fbe8c88f7e5f1551d

12
inherit_graph_42.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="63pt" height="28pt"
viewBox="0.00 0.00 63.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="117pt" height="28pt"
viewBox="0.00 0.00 117.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 59,-24 59,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 113,-24 113,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d0/dff/structlinkedlist.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 55,-19.5 55,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linkedlist</text>
<g id="a_node1"><a xlink:href="db/d19/structlinear__probing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 109,-19.5 109,-0.5 0,-0.5"/>
<text text-anchor="middle" x="54.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::Entry</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1002 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_43.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d10/structlist.html" title=" " alt="" coords="5,5,44,32"/>
<area shape="rect" id="node1" href="$d0/dff/structlinkedlist.html" title=" " alt="" coords="5,5,79,32"/>
</map>

2
inherit_graph_43.md5
View File

@@ -1 +1 @@
e6fa82a0e450cb795421ea95e90b2fe6
5fc9ec91cf1ed515d3e948f26519c17a

12
inherit_graph_43.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="37pt" height="28pt"
viewBox="0.00 0.00 37.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="63pt" height="28pt"
viewBox="0.00 0.00 63.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 33,-24 33,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 59,-24 59,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d10/structlist.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 29,-19.5 29,-0.5 0,-0.5"/>
<text text-anchor="middle" x="14.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
<g id="a_node1"><a xlink:href="d0/dff/structlinkedlist.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 55,-19.5 55,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linkedlist</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 990 B

After

Width:  |  Height:  |  Size: 1002 B

2
inherit_graph_44.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d6/d30/classmachine__learning_1_1adaline.html" title=" " alt="" coords="5,5,183,32"/>
<area shape="rect" id="node1" href="$d8/d10/structlist.html" title=" " alt="" coords="5,5,44,32"/>
</map>

2
inherit_graph_44.md5
View File

@@ -1 +1 @@
a4563c6e45ac1fa78e07acb60fc5fa50
e6fa82a0e450cb795421ea95e90b2fe6

12
inherit_graph_44.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="141pt" height="28pt"
viewBox="0.00 0.00 141.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="37pt" height="28pt"
viewBox="0.00 0.00 37.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 137,-24 137,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 33,-24 33,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d6/d30/classmachine__learning_1_1adaline.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 133,-19.5 133,-0.5 0,-0.5"/>
<text text-anchor="middle" x="66.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
<g id="a_node1"><a xlink:href="d8/d10/structlist.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 29,-19.5 29,-0.5 0,-0.5"/>
<text text-anchor="middle" x="14.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 990 B

2
inherit_graph_45.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state." alt="" coords="5,5,176,61"/>
<area shape="rect" id="node1" href="$d6/d30/classmachine__learning_1_1adaline.html" title=" " alt="" coords="5,5,183,32"/>
</map>

2
inherit_graph_45.md5
View File

@@ -1 +1 @@
fb9d222e488be11b364a263ed1973e8e
a4563c6e45ac1fa78e07acb60fc5fa50

16
inherit_graph_45.svg
View File

@@ -4,19 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="136pt" height="50pt"
viewBox="0.00 0.00 136.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<svg width="141pt" height="28pt"
viewBox="0.00 0.00 141.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 132,-46 132,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 137,-24 137,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_top" xlink:title="A class defining A* search algorithm. for some initial state and final state.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 128,-41.5 128,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch&lt;</text>
<text text-anchor="middle" x="64" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;</text>
<g id="a_node1"><a xlink:href="d6/d30/classmachine__learning_1_1adaline.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 133,-19.5 133,-0.5 0,-0.5"/>
<text text-anchor="middle" x="66.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_46.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" title="Custom comparator for open_list." alt="" coords="5,5,216,61"/>
<area shape="rect" id="node1" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state." alt="" coords="5,5,176,61"/>
</map>

2
inherit_graph_46.md5
View File

@@ -1 +1 @@
135e20d1f0881b6cf5d2d1d160acbe92
fb9d222e488be11b364a263ed1973e8e

12
inherit_graph_46.svg
View File

@@ -4,19 +4,19 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="166pt" height="50pt"
viewBox="0.00 0.00 166.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="136pt" height="50pt"
viewBox="0.00 0.00 136.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 162,-46 162,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 132,-46 132,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_top" xlink:title="Custom comparator for open_list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 158,-41.5 158,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_top" xlink:title="A class defining A* search algorithm. for some initial state and final state.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 128,-41.5 128,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch&lt;</text>
<text text-anchor="middle" x="79" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;::comparison_operator</text>
<text text-anchor="middle" x="64" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

2
inherit_graph_47.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" title="Struct that handles all the information related to the current state." alt="" coords="5,5,176,61"/>
<area shape="rect" id="node1" href="$d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" title="Custom comparator for open_list." alt="" coords="5,5,216,61"/>
</map>

2
inherit_graph_47.md5
View File

@@ -1 +1 @@
2ad730e054eae2222b70f2072322e2b4
135e20d1f0881b6cf5d2d1d160acbe92

12
inherit_graph_47.svg
View File

@@ -4,19 +4,19 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="136pt" height="50pt"
viewBox="0.00 0.00 136.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="166pt" height="50pt"
viewBox="0.00 0.00 166.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 132,-46 132,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 162,-46 162,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_top" xlink:title="Struct that handles all the information related to the current state.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 128,-41.5 128,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_top" xlink:title="Custom comparator for open_list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 158,-41.5 158,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch&lt;</text>
<text text-anchor="middle" x="64" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;::Info</text>
<text text-anchor="middle" x="79" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;::comparison_operator</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB

2
inherit_graph_48.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="5,5,185,47"/>
<area shape="rect" id="node1" href="$da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" title="Struct that handles all the information related to the current state." alt="" coords="5,5,176,61"/>
</map>

2
inherit_graph_48.md5
View File

@@ -1 +1 @@
0ebaea2272ec2603600f729ca3888d1e
2ad730e054eae2222b70f2072322e2b4

17
inherit_graph_48.svg
View File

@@ -4,18 +4,19 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="143pt" height="39pt"
viewBox="0.00 0.00 143.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<svg width="136pt" height="50pt"
viewBox="0.00 0.00 136.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 139,-35 139,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 132,-46 132,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_top" xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 135,-30.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
<g id="a_node1"><a xlink:href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_top" xlink:title="Struct that handles all the information related to the current state.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 128,-41.5 128,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch&lt;</text>
<text text-anchor="middle" x="64" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> Puzzle &gt;::Info</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB

2
inherit_graph_49.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" title=" " alt="" coords="5,5,204,47"/>
<area shape="rect" id="node1" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="5,5,185,47"/>
</map>

2
inherit_graph_49.md5
View File

@@ -1 +1 @@
5210a7087f1427d45a2c06df1d00a382
0ebaea2272ec2603600f729ca3888d1e

14
inherit_graph_49.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="157pt" height="39pt"
viewBox="0.00 0.00 157.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="143pt" height="39pt"
viewBox="0.00 0.00 143.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 153,-35 153,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 139,-35 139,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 149,-30.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
<g id="a_node1"><a xlink:href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_top" xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 135,-30.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_50.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" title=" " alt="" coords="5,5,177,47"/>
<area shape="rect" id="node1" href="$dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" title=" " alt="" coords="5,5,204,47"/>
</map>

2
inherit_graph_50.md5
View File

@@ -1 +1 @@
f32e15a754740551f1e1ede4db060a54
5210a7087f1427d45a2c06df1d00a382

12
inherit_graph_50.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="137pt" height="39pt"
viewBox="0.00 0.00 137.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="157pt" height="39pt"
viewBox="0.00 0.00 157.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 133,-35 133,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 153,-35 153,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 129,-30.5 129,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 149,-30.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
<text text-anchor="middle" x="64.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_51.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p." alt="" coords="5,5,149,47"/>
<area shape="rect" id="node1" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" title=" " alt="" coords="5,5,177,47"/>
</map>

2
inherit_graph_51.md5
View File

@@ -1 +1 @@
114b671cdf513aab630a251c680de828
f32e15a754740551f1e1ede4db060a54

14
inherit_graph_51.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 116.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="137pt" height="39pt"
viewBox="0.00 0.00 137.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 112,-35 112,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 133,-35 133,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_top" xlink:title="Class which contains all methods required for calculating nCr mod p.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 108,-30.5 108,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="54" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP</text>
<g id="a_node1"><a xlink:href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 129,-30.5 129,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
<text text-anchor="middle" x="64.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_52.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d2/d05/class_min_heap.html" title=" " alt="" coords="5,5,81,32"/>
<area shape="rect" id="node1" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p." alt="" coords="5,5,149,47"/>
</map>

2
inherit_graph_52.md5
View File

@@ -1 +1 @@
20a3344e5b7c2798c614a5832bb050be
114b671cdf513aab630a251c680de828

15
inherit_graph_52.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="65pt" height="28pt"
viewBox="0.00 0.00 65.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 116.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 61,-24 61,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 112,-35 112,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 57,-19.5 57,-0.5 0,-0.5"/>
<text text-anchor="middle" x="28.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</text>
<g id="a_node1"><a xlink:href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_top" xlink:title="Class which contains all methods required for calculating nCr mod p.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 108,-30.5 108,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="54" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 997 B

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_53.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/d29/struct_min_heap_node.html" title=" " alt="" coords="5,5,112,32"/>
<area shape="rect" id="node1" href="$d2/d05/class_min_heap.html" title=" " alt="" coords="5,5,81,32"/>
</map>

2
inherit_graph_53.md5
View File

@@ -1 +1 @@
b7390394bbaa0abd74424ba9a880f9e2
20a3344e5b7c2798c614a5832bb050be

12
inherit_graph_53.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="88pt" height="28pt"
viewBox="0.00 0.00 88.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="65pt" height="28pt"
viewBox="0.00 0.00 65.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 84,-24 84,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 61,-24 61,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/d29/struct_min_heap_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 80,-19.5 80,-0.5 0,-0.5"/>
<text text-anchor="middle" x="40" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</text>
<g id="a_node1"><a xlink:href="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 57,-19.5 57,-0.5 0,-0.5"/>
<text text-anchor="middle" x="28.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1005 B

After

Width:  |  Height:  |  Size: 997 B

2
inherit_graph_54.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d1/d77/structmst.html" title=" " alt="" coords="5,5,49,32"/>
<area shape="rect" id="node1" href="$d5/d29/struct_min_heap_node.html" title=" " alt="" coords="5,5,112,32"/>
</map>

2
inherit_graph_54.md5
View File

@@ -1 +1 @@
dac11be16a53d20641c8a15ac8df90c8
b7390394bbaa0abd74424ba9a880f9e2

12
inherit_graph_54.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="41pt" height="28pt"
viewBox="0.00 0.00 41.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="88pt" height="28pt"
viewBox="0.00 0.00 88.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 37,-24 37,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 84,-24 84,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d1/d77/structmst.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">mst</text>
<g id="a_node1"><a xlink:href="d5/d29/struct_min_heap_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 80,-19.5 80,-0.5 0,-0.5"/>
<text text-anchor="middle" x="40" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 988 B

After

Width:  |  Height:  |  Size: 1005 B

2
inherit_graph_55.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d8b/struct_node.html" title=" " alt="" coords="5,5,59,32"/>
<area shape="rect" id="node1" href="$d1/d77/structmst.html" title=" " alt="" coords="5,5,49,32"/>
</map>

2
inherit_graph_55.md5
View File

@@ -1 +1 @@
345302fd1e3a1df4f5d11eaae31127fd
dac11be16a53d20641c8a15ac8df90c8

12
inherit_graph_55.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="41pt" height="28pt"
viewBox="0.00 0.00 41.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 37,-24 37,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d8b/struct_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node</text>
<g id="a_node1"><a xlink:href="d1/d77/structmst.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">mst</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 989 B

After

Width:  |  Height:  |  Size: 988 B

2
inherit_graph_56.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,107,32"/>
<area shape="rect" id="node1" href="$db/d8b/struct_node.html" title=" " alt="" coords="5,5,59,32"/>
</map>

2
inherit_graph_56.md5
View File

@@ -1 +1 @@
ed0ff6113ee370c2e2e0573042492713
345302fd1e3a1df4f5d11eaae31127fd

12
inherit_graph_56.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="84pt" height="28pt"
viewBox="0.00 0.00 84.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 80,-24 80,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/da1/structnode.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 76,-19.5 76,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Kind &gt;</text>
<g id="a_node1"><a xlink:href="db/d8b/struct_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1002 B

After

Width:  |  Height:  |  Size: 989 B

2
inherit_graph_57.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,204,61"/>
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,107,32"/>
</map>

2
inherit_graph_57.md5
View File

@@ -1 +1 @@
74e4dac2781f0ed9148fccdee3689b6b
ed0ff6113ee370c2e2e0573042492713

16
inherit_graph_57.svg
View File

@@ -4,19 +4,17 @@
<!-- Generated by graphviz version 2.49.3 (20211023.0002)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="157pt" height="50pt"
viewBox="0.00 0.00 157.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<svg width="84pt" height="28pt"
viewBox="0.00 0.00 84.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 153,-46 153,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 80,-24 80,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_top" xlink:title="A class that implements a Circular Linked List.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList</text>
<g id="a_node1"><a xlink:href="d5/da1/structnode.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 76,-19.5 76,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Kind &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1002 B

2
inherit_graph_58.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree." alt="" coords="5,5,204,47"/>
<area shape="rect" id="node1" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,204,61"/>
</map>

2
inherit_graph_58.md5
View File

@@ -1 +1 @@
83e2b0099dfac666237627072595f4fc
74e4dac2781f0ed9148fccdee3689b6b

Some files were not shown because too many files have changed in this diff Show More