mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
Documentation for d8b4da68bf
This commit is contained in:
github-actions
@@ -103,53 +103,57 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_1_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">▼</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">double hashing</a> algorithm </td></tr>
|
||||
<tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </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;"> </span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">▼</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_3_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">▼</span><span class="icona"><span class="icon">N</span></span><b>is_graph_bipartite</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_0_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </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>
|
||||
<tr id="row_3_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_2_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_4_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc">Machine learning algorithms </td></tr>
|
||||
<tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_6_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_7_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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;"> </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_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_13_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_29_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_38_" class="arrow" onclick="toggleFolder('38_')">▼</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_38_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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">TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">▼</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"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">▼</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_"><td class="entry"><span style="width:48px;display:inline-block;"> </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"><td class="entry"><span style="width:48px;display:inline-block;"> </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_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">▼</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_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_4_0_" class="arrow" onclick="toggleFolder('4_0_')">▼</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_"><td class="entry"><span style="width:48px;display:inline-block;"> </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>
|
||||
<tr id="row_4_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_2_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_5_" class="arrow" onclick="toggleFolder('5_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d89/namespacelinear__probing.html" target="_self">linear_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Linear_probing">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_5_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_6_" class="arrow" onclick="toggleFolder('6_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc">Machine learning algorithms </td></tr>
|
||||
<tr id="row_6_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_7_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_8_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_10_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_11_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_12_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_14_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_39_" class="arrow" onclick="toggleFolder('39_')">▼</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_39_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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">TrieNode</a></td><td class="desc"></td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -3,6 +3,7 @@ var annotated_dup =
|
||||
[ "ciphers", "d6/d4e/namespaceciphers.html", "d6/d4e/namespaceciphers" ],
|
||||
[ "data_structure", "d1/db4/namespacedata__structure.html", "d1/db4/namespacedata__structure" ],
|
||||
[ "double_hashing", "d0/d65/namespacedouble__hashing.html", "d0/d65/namespacedouble__hashing" ],
|
||||
[ "geometry", "d5/d5f/namespacegeometry.html", "d5/d5f/namespacegeometry" ],
|
||||
[ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ],
|
||||
[ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ],
|
||||
[ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ],
|
||||
@@ -25,8 +26,8 @@ var annotated_dup =
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ],
|
||||
[ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ],
|
||||
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
|
||||
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
|
||||
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
|
||||
97
classes.html
97
classes.html
@@ -101,37 +101,36 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<td valign="top"><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  l  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  p  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d4f/class_solution.html">Solution</a>   </td>
|
||||
<td valign="top"><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)   </td>
|
||||
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d1/dc2/classstack.html">stack</a>   </td>
|
||||
<tr><td valign="top"><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  q  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)   </td>
|
||||
<td valign="top"><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)   </td>
|
||||
<td valign="top"><a class="el" href="db/d82/classlarge__number.html">large_number</a>   </td>
|
||||
<td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  t  </div></td></tr></table>
|
||||
</td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_b"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  b  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  f  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  q  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d8/d10/structlist.html">list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)   </td>
|
||||
<td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/d90/struct_btree.html">Btree</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d91/class_fenwick_tree.html">FenwickTree</a>   </td>
|
||||
<td valign="top"><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)   </td>
|
||||
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  t  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/dd9/structtrie.html">trie</a>   </td>
|
||||
</tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  c  </div></td></tr></table>
|
||||
</td>
|
||||
@@ -139,60 +138,64 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_m"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  m  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>   </td>
|
||||
<td valign="top"><a class="el" href="d0/dd2/class_queue___array.html">Queue_Array</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d2f/class_trie.html">Trie</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>   </td>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_r"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  r  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d5/d15/classcll.html">cll</a>   </td>
|
||||
<td valign="top"><a class="el" href="da/d9a/class_graph.html">Graph</a>   </td>
|
||||
<td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>   </td>
|
||||
<td valign="top"><a class="el" href="d0/dd2/class_queue___array.html">Queue_Array</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/dd9/structtrie.html">trie</a>   </td>
|
||||
</tr>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d1/db3/structcompare.html">compare</a>   </td>
|
||||
<td valign="top"><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">Graph</a> (graph::is_graph_bipartite)   </td>
|
||||
<td valign="top"><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_r"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  r  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d2f/class_trie.html">Trie</a>   </td>
|
||||
</tr>
|
||||
<td valign="top"><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>   </td>
|
||||
<td valign="top"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d1/d77/structmst.html">mst</a>   </td>
|
||||
<td valign="top"><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a>   </td>
|
||||
</tr>
|
||||
<tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_s"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  s  </div></td></tr></table>
|
||||
</td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  h  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  n  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_d"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  d  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_s"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  s  </div></td></tr></table>
|
||||
</td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="dd/d1c/classhash__chain.html">hash_chain</a>   </td>
|
||||
<td valign="top"><a class="el" href="d3/d6f/structdata__structure_1_1_node.html">Node</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>   </td>
|
||||
<td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>   </td>
|
||||
<td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  e  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  i  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="dd/d1c/classhash__chain.html">hash_chain</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>   </td>
|
||||
<td valign="top"><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html">SkipList</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td></td></tr>
|
||||
<tr><td></td><td></td><td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>   </td>
|
||||
<td valign="top"><a class="el" href="dd/d4f/class_solution.html">Solution</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>   </td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  i  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d3/d6f/structdata__structure_1_1_node.html">Node</a> (<a class="el" href="d1/db4/namespacedata__structure.html">data_structure</a>)   </td>
|
||||
<td valign="top"><a class="el" href="d1/dc2/classstack.html">stack</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  e  </div></td></tr></table>
|
||||
</td>
|
||||
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">  p  </div></td></tr></table>
|
||||
</td>
|
||||
<td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>   </td>
|
||||
<td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>   </td>
|
||||
<td></td><td></td></tr>
|
||||
<tr><td valign="top"><a class="el" href="d7/d77/class_edge.html">Edge</a>   </td>
|
||||
<td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>   </td>
|
||||
<td></td><td></td><td></td></tr>
|
||||
<td></td><td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>   </td>
|
||||
<td></td><td></td></tr>
|
||||
<tr><td></td><td></td><td></td><td></td><td></td></tr>
|
||||
</table>
|
||||
<div class="qindex"><a class="qindex" href="#letter_a">a</a> | <a class="qindex" href="#letter_b">b</a> | <a class="qindex" href="#letter_c">c</a> | <a class="qindex" href="#letter_d">d</a> | <a class="qindex" href="#letter_e">e</a> | <a class="qindex" href="#letter_f">f</a> | <a class="qindex" href="#letter_g">g</a> | <a class="qindex" href="#letter_h">h</a> | <a class="qindex" href="#letter_i">i</a> | <a class="qindex" href="#letter_l">l</a> | <a class="qindex" href="#letter_m">m</a> | <a class="qindex" href="#letter_n">n</a> | <a class="qindex" href="#letter_p">p</a> | <a class="qindex" href="#letter_q">q</a> | <a class="qindex" href="#letter_r">r</a> | <a class="qindex" href="#letter_s">s</a> | <a class="qindex" href="#letter_t">t</a></div>
|
||||
|
||||
6
d1/d73/jarvis__algorithm_8cpp__incl.map
Normal file
6
d1/d73/jarvis__algorithm_8cpp__incl.map
Normal file
@@ -0,0 +1,6 @@
|
||||
<map id="geometry/jarvis_algorithm.cpp" name="geometry/jarvis_algorithm.cpp">
|
||||
<area shape="rect" id="node1" title="Implementation of Jarvis’s algorithm." alt="" coords="23,5,219,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,80,64,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="89,80,154,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="179,80,251,107"/>
|
||||
</map>
|
||||
1
d1/d73/jarvis__algorithm_8cpp__incl.md5
Normal file
1
d1/d73/jarvis__algorithm_8cpp__incl.md5
Normal file
@@ -0,0 +1 @@
|
||||
e377ef27c1cdee230f1b67e590737155
|
||||
67
d1/d73/jarvis__algorithm_8cpp__incl.svg
Normal file
67
d1/d73/jarvis__algorithm_8cpp__incl.svg
Normal file
@@ -0,0 +1,67 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: geometry/jarvis_algorithm.cpp Pages: 1 -->
|
||||
<svg width="192pt" height="84pt"
|
||||
viewBox="0.00 0.00 192.00 84.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 80)">
|
||||
<title>geometry/jarvis_algorithm.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 188,-80 188,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Implementation of Jarvis’s algorithm.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="13.5,-56.5 13.5,-75.5 160.5,-75.5 160.5,-56.5 13.5,-56.5"/>
|
||||
<text text-anchor="middle" x="87" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry/jarvis_algorithm.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" 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">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M76.56,-56.32C66.85,-48.26 52.18,-36.08 40.5,-26.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="42.56,-23.53 32.63,-19.83 38.09,-28.92 42.56,-23.53"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="62.5,-0.5 62.5,-19.5 111.5,-19.5 111.5,-0.5 62.5,-0.5"/>
|
||||
<text text-anchor="middle" x="87" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M87,-56.08C87,-49.01 87,-38.86 87,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="90.5,-29.75 87,-19.75 83.5,-29.75 90.5,-29.75"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="130,-0.5 130,-19.5 184,-19.5 184,-0.5 130,-0.5"/>
|
||||
<text text-anchor="middle" x="157" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M98.25,-56.32C108.8,-48.18 124.8,-35.84 137.44,-26.09"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.77,-28.71 145.55,-19.83 135.49,-23.17 139.77,-28.71"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.9 KiB |
116
d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html
Normal file
116
d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html
Normal file
@@ -0,0 +1,116 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d4/dde/classgeometry_1_1jarvis_1_1_convexhull.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::jarvis::Convexhull Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">Convexhull</a>(const std::vector< Point > &pointList)</td><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">getConvexHull</a>() const</td><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">orientation</a>(const Point &p, const Point &q, const Point &r)</td><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">static</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>points</b> (defined in <a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a>)</td><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>size</b> (defined in <a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a>)</td><td class="entry"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td><td class="entry"><span class="mlabel">private</span></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="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
113
d2/d36/structgeometry_1_1jarvis_1_1_point-members.html
Normal file
113
d2/d36/structgeometry_1_1jarvis_1_1_point-members.html
Normal file
@@ -0,0 +1,113 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d9/d5a/structgeometry_1_1jarvis_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::jarvis::Point Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::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="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a>)</td><td class="entry"><a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>y</b> (defined in <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a>)</td><td class="entry"><a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::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="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -402,9 +402,11 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="abitset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset.html">std::bitset< MAXN ></a></div></div>
|
||||
<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:37</div></div>
|
||||
<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a878952f2eb3d1fae79d58c994fc10ab1"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">geometry::jarvis::Convexhull::getConvexHull</a></div><div class="ttdeci">std::vector< Point > getConvexHull() const</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:78</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_a6cb6fbec4ea7cfdfda368f2c468a757d"><div class="ttname"><a href="../../da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d">Graph::getAdjList</a></div><div class="ttdeci">std::remove_reference< AdjList >::type const & getAdjList() const</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:103</div></div>
|
||||
<div class="ttc" id="aclass_cycle_check_html_a399292a33edf87499daa52b51315aca5"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a></div><div class="ttdeci">static bool isCyclicBFS(Graph const &graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:249</div></div>
|
||||
<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
|
||||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:151</div></div>
|
||||
<div class="ttc" id="afibonacci_8cpp_html_ae7c261942e9479f06ac145c08dcb6cc7"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#ae7c261942e9479f06ac145c08dcb6cc7">fibonacci</a></div><div class="ttdeci">unsigned int fibonacci(unsigned int n)</div><div class="ttdef"><b>Definition:</b> fibonacci.cpp:17</div></div>
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_a69fe1f7c36fe004ba83eef2ca82e7e30"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:222</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a275227d01fbecdcf2f890b034fcea655"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a275227d01fbecdcf2f890b034fcea655">graph::is_graph_bipartite::Graph::nax</a></div><div class="ttdeci">static const int nax</div><div class="ttdoc">stores the side of the vertex</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:57</div></div>
|
||||
@@ -444,6 +446,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aclasshash__chain_html_a55aa5c6753cb8853152d469c375d946a"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">hash_chain::find</a></div><div class="ttdeci">bool find(int x, int h) const</div><div class="ttdoc">Find if a value and corresponding hash exist.</div><div class="ttdef"><b>Definition:</b> chaining.cpp:101</div></div>
|
||||
<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a0acbe32aaab897e7939e5b0454035b8c"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">machine_learning::adaline::adaline</a></div><div class="ttdeci">adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:55</div></div>
|
||||
<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">Geometry algorithms.</div></div>
|
||||
<div class="ttc" id="aclass_trie_html"><div class="ttname"><a href="../../dd/d2f/class_trie.html">Trie</a></div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:16</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html_a6a082dc1426a79f866cee6b370df37b0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:138</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< int ></a></div></div>
|
||||
@@ -453,6 +456,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a74e3c6c037b67895014414c5d75465e5"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline::fit</a></div><div class="ttdeci">double fit(const std::vector< double > &x, const int &y)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:119</div></div>
|
||||
<div class="ttc" id="adouble__hash__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:250</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a8306e48040a8570e164c58d1c530f870"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">geometry::jarvis::Convexhull::Convexhull</a></div><div class="ttdeci">Convexhull(const std::vector< Point > &pointList)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:66</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_ae1e03712837450549e0c9b4017533a41"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">Complex::arg</a></div><div class="ttdeci">double arg() const</div><div class="ttdoc">Member function to give the argument of our complex number.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:87</div></div>
|
||||
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</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 class="ttdoc">STL class.</div></div>
|
||||
@@ -638,11 +642,13 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:143</div></div>
|
||||
<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:199</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html_a59b4441a0e447469e9a4f61c87f33102"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a59b4441a0e447469e9a4f61c87f33102">graph::add_undirected_edge</a></div><div class="ttdeci">void add_undirected_edge(std::vector< std::vector< int >> *graph, int u, int v)</div><div class="ttdoc">Adds an undirected edge from vertex u to vertex v. Essentially adds too directed edges to the adjacen...</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:81</div></div>
|
||||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:176</div></div>
|
||||
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector< bool > &is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
|
||||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:142</div></div>
|
||||
<div class="ttc" id="aclass_graph_html_a8c95e00effaea0cd9404dd74cd802ae3"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList &&adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:76</div></div>
|
||||
<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div><div class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacejarvis_html"><div class="ttname"><a href="../../d5/da7/namespacejarvis.html">jarvis</a></div><div class="ttdoc">Functions for Jarvis’s algorithm.</div></div>
|
||||
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9d10768f927baa8a4d4a5ffce295b6b6"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph::side</a></div><div class="ttdeci">std::vector< int > side</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:55</div></div>
|
||||
<div class="ttc" id="agroup__machine__learning_html_ga6c606bc85a3e9fd9d010f874ad760336"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:65</div></div>
|
||||
<div class="ttc" id="anamespacelinear__probing_html"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></div><div class="ttdoc">An implementation of hash table using linear probing algorithm.</div></div>
|
||||
@@ -655,6 +661,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:38</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ac656a51b4c3bd7d63b7dcc75dc3e5576"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ac656a51b4c3bd7d63b7dcc75dc3e5576">sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:21</div></div>
|
||||
<div class="ttc" id="aclassstack_html_a21c0bb6ce7dcfe445cc12031977ea344"><div class="ttname"><a href="../../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344">stack::top</a></div><div class="ttdeci">Type top()</div><div class="ttdef"><b>Definition:</b> stack.h:93</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div>
|
||||
<div class="ttc" id="abreadth__first__search_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:121</div></div>
|
||||
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0ceb473236b5dc53a85e281ef528dd96"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0ceb473236b5dc53a85e281ef528dd96">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector< std::vector< bool >> &routes)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:30</div></div>
|
||||
<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:93</div></div>
|
||||
@@ -719,6 +726,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
|
||||
<div class="ttc" id="aclassstack_html_a67f65710c376f67d1ba3bde45a9cb628"><div class="ttname"><a href="../../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> stack.h:29</div></div>
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:70</div></div>
|
||||
<div class="ttc" id="astructgeometry_1_1jarvis_1_1_point_html"><div class="ttname"><a href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:47</div></div>
|
||||
<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:414</div></div>
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:56</div></div>
|
||||
@@ -736,6 +744,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
|
||||
<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:56</div></div>
|
||||
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:20</div></div>
|
||||
<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:38</div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &p, const Point &q, const Point &r)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:133</div></div>
|
||||
<div class="ttc" id="aclass_complex_html_a820afcbb330df716577459d7a3aa3a1c"><div class="ttname"><a href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex::operator+</a></div><div class="ttdeci">Complex operator+(const Complex &other)</div><div class="ttdoc">Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:95</div></div>
|
||||
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:41</div></div>
|
||||
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
|
||||
|
||||
248
d4/d8d/jarvis__algorithm_8cpp.html
Normal file
248
d4/d8d/jarvis__algorithm_8cpp.html
Normal file
@@ -0,0 +1,248 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: geometry/jarvis_algorithm.cpp File 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d4/d8d/jarvis__algorithm_8cpp.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="#nested-classes">Classes</a> |
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">jarvis_algorithm.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <vector></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for jarvis_algorithm.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d73/jarvis__algorithm_8cpp__incl.svg" width="256" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:d5/d5f/namespacegeometry"><td class="memItemLeft" align="right" valign="top">  </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"> </td><td class="mdescRight">Geometry algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d5/da7/namespacejarvis"><td class="memItemLeft" align="right" valign="top">  </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"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. </p>
|
||||
<p>Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.</p>
|
||||
<h3><a class="anchor" id="autotoc_md39"></a>
|
||||
Algorithm</h3>
|
||||
<p>The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.</p>
|
||||
<p>The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.</p>
|
||||
<p>For Example, If points = {{0, 3}, {2, 2}, {1, 1}, {2, 1}, {3, 0}, {0, 0}, {3, 3}};</p>
|
||||
<p>then the convex hull is (0, 3), (0, 0), (3, 0), (3, 3)</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rishabh-997">Rishabh Agarwal</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Driver Code </p>
|
||||
<div class="fragment"><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  {</div>
|
||||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <a class="code" href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
|
||||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="626" height="134"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void test </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Test function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  {</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<geometry::jarvis::Point></a> points = {{0, 3},</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  {2, 2},</div>
|
||||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  {1, 1},</div>
|
||||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  {2, 1},</div>
|
||||
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  {3, 0},</div>
|
||||
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  {0, 0},</div>
|
||||
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  {3, 3}</div>
|
||||
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  };</div>
|
||||
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <a class="code" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a> hull(points);</div>
|
||||
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<geometry::jarvis::Point></a> actualPoint;</div>
|
||||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  actualPoint = hull.getConvexHull();</div>
|
||||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  </div>
|
||||
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<geometry::jarvis::Point></a> expectedPoint = {{0, 3},</div>
|
||||
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  {0, 0},</div>
|
||||
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {3, 0},</div>
|
||||
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  {3, 3}};</div>
|
||||
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expectedPoint.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
|
||||
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  assert(actualPoint[i].x == expectedPoint[i].x);</div>
|
||||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  assert(actualPoint[i].y == expectedPoint[i].y);</div>
|
||||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Test implementations passed!\n"</span>;</div>
|
||||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="527" height="134"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:151</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< geometry::jarvis::Point ></a></div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div>
|
||||
<!-- 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"><a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
7
d4/d8d/jarvis__algorithm_8cpp.js
Normal file
7
d4/d8d/jarvis__algorithm_8cpp.js
Normal file
@@ -0,0 +1,7 @@
|
||||
var jarvis__algorithm_8cpp =
|
||||
[
|
||||
[ "Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", "d9/d5a/structgeometry_1_1jarvis_1_1_point" ],
|
||||
[ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull" ],
|
||||
[ "main", "d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "test", "d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
|
||||
];
|
||||
@@ -0,0 +1,7 @@
|
||||
<map id="test" name="test">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,71,49,98"/>
|
||||
<area shape="rect" id="node2" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1" title=" " alt="" coords="97,35,285,76"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="133,101,249,127"/>
|
||||
<area shape="rect" id="node3" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="333,5,521,47"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="350,71,505,98"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
ee1d49cd2b811688c44c6848ff6a40f6
|
||||
@@ -0,0 +1,84 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<svg width="395pt" height="100pt"
|
||||
viewBox="0.00 0.00 395.00 99.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 95.5)">
|
||||
<title>test</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-95.5 391,-95.5 391,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-22.5 0,-41.5 33,-41.5 33,-22.5 0,-22.5"/>
|
||||
<text text-anchor="middle" x="16.5" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="69,-39 69,-69 210,-69 210,-39 69,-39"/>
|
||||
<text text-anchor="start" x="77" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="139.5" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.32,-34.88C40.43,-36.17 49.4,-37.8 59.09,-39.56"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="58.51,-43.01 68.98,-41.36 59.77,-36.13 58.51,-43.01"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="96,-0.5 96,-19.5 183,-19.5 183,-0.5 96,-0.5"/>
|
||||
<text text-anchor="middle" x="139.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.32,-29.12C46.73,-26.69 66.76,-23.04 85.76,-19.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="86.64,-22.99 95.85,-17.75 85.39,-16.1 86.64,-22.99"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="246,-61 246,-91 387,-91 387,-61 246,-61"/>
|
||||
<text text-anchor="start" x="254" y="-79" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="316.5" y="-68" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M210.17,-62.76C218.59,-63.82 227.25,-64.91 235.81,-65.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="235.43,-69.46 245.79,-67.24 236.3,-62.52 235.43,-69.46"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="258.5,-22.5 258.5,-41.5 374.5,-41.5 374.5,-22.5 258.5,-22.5"/>
|
||||
<text text-anchor="middle" x="316.5" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M210.17,-45.24C222.68,-43.67 235.7,-42.03 248.14,-40.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="248.95,-43.89 258.43,-39.17 248.07,-36.95 248.95,-43.89"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.1 KiB |
@@ -0,0 +1,8 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,71,56,98"/>
|
||||
<area shape="rect" id="node2" href="$d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="104,71,148,98"/>
|
||||
<area shape="rect" id="node3" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1" title=" " alt="" coords="196,35,384,76"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="232,101,348,127"/>
|
||||
<area shape="rect" id="node4" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="432,5,620,47"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="449,71,603,98"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
7300215fd64a9d0f8b5600a39bc44c17
|
||||
@@ -0,0 +1,99 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="469pt" height="100pt"
|
||||
viewBox="0.00 0.00 469.00 99.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 95.5)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-95.5 465,-95.5 465,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-22.5 0,-41.5 38,-41.5 38,-22.5 0,-22.5"/>
|
||||
<text text-anchor="middle" x="19" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="74,-22.5 74,-41.5 107,-41.5 107,-22.5 74,-22.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.26,-32C46.07,-32 55.31,-32 63.79,-32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-35.5 73.95,-32 63.95,-28.5 63.95,-35.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="143,-39 143,-69 284,-69 284,-39 143,-39"/>
|
||||
<text text-anchor="start" x="151" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="213.5" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.32,-34.88C114.43,-36.17 123.4,-37.8 133.09,-39.56"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="132.51,-43.01 142.98,-41.36 133.77,-36.13 132.51,-43.01"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="170,-0.5 170,-19.5 257,-19.5 257,-0.5 170,-0.5"/>
|
||||
<text text-anchor="middle" x="213.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.32,-29.12C120.73,-26.69 140.76,-23.04 159.76,-19.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="160.64,-22.99 169.85,-17.75 159.39,-16.1 160.64,-22.99"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="320,-61 320,-91 461,-91 461,-61 320,-61"/>
|
||||
<text text-anchor="start" x="328" y="-79" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="390.5" y="-68" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M284.17,-62.76C292.59,-63.82 301.25,-64.91 309.81,-65.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="309.43,-69.46 319.79,-67.24 310.3,-62.52 309.43,-69.46"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="332.5,-22.5 332.5,-41.5 448.5,-41.5 448.5,-22.5 332.5,-22.5"/>
|
||||
<text text-anchor="middle" x="390.5" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node3->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M284.17,-45.24C296.68,-43.67 309.7,-42.03 322.14,-40.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="322.95,-43.89 332.43,-39.17 322.07,-36.95 322.95,-43.89"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.8 KiB |
335
d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html
Normal file
335
d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html
Normal file
@@ -0,0 +1,335 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: geometry::jarvis::Convexhull Class Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d4/dde/classgeometry_1_1jarvis_1_1_convexhull.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-methods">Public Member Functions</a> |
|
||||
<a href="#pub-static-methods">Static Public Member Functions</a> |
|
||||
<a href="#pri-attribs">Private Attributes</a> |
|
||||
<a href="../../d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">geometry::jarvis::Convexhull Class Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for geometry::jarvis::Convexhull:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg" width="199" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a8306e48040a8570e164c58d1c530f870"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">Convexhull</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> > &pointList)</td></tr>
|
||||
<tr class="separator:a8306e48040a8570e164c58d1c530f870"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a878952f2eb3d1fae79d58c994fc10ab1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">getConvexHull</a> () const</td></tr>
|
||||
<tr class="separator:a878952f2eb3d1fae79d58c994fc10ab1"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-static-methods"></a>
|
||||
Static Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a54df5f9a8f37170bd97c91127664655c"><td class="memItemLeft" align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">orientation</a> (const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &p, const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &q, const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &r)</td></tr>
|
||||
<tr class="separator:a54df5f9a8f37170bd97c91127664655c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
|
||||
Private Attributes</h2></td></tr>
|
||||
<tr class="memitem:a835cd4cdc5a644abb84535197d753b02"><td class="memItemLeft" align="right" valign="top"><a id="a835cd4cdc5a644abb84535197d753b02"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> > </td><td class="memItemRight" valign="bottom"><b>points</b></td></tr>
|
||||
<tr class="separator:a835cd4cdc5a644abb84535197d753b02"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2272bb62c35af959953b0ea06b010036"><td class="memItemLeft" align="right" valign="top"><a id="a2272bb62c35af959953b0ea06b010036"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
|
||||
<tr class="separator:a2272bb62c35af959953b0ea06b010036"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Class which can be called from main and is globally available throughout the code </p>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="a8306e48040a8570e164c58d1c530f870"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a8306e48040a8570e164c58d1c530f870">◆ </a></span>Convexhull()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">geometry::jarvis::Convexhull::Convexhull </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> > & </td>
|
||||
<td class="paramname"><em>pointList</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Constructor of given class</p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">pointList</td><td>list of all points in the space </td></tr>
|
||||
<tr><td class="paramname">n</td><td>number of points in space </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<div class="fragment"><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  {</div>
|
||||
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  points = pointList;</div>
|
||||
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  size = points.size();</div>
|
||||
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg" width="363" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a878952f2eb3d1fae79d58c994fc10ab1"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a878952f2eb3d1fae79d58c994fc10ab1">◆ </a></span>getConvexHull()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><<a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a>> geometry::jarvis::Convexhull::getConvexHull </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td> const</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Creates convex hull of a set of n points. There must be 3 points at least for the convex hull to exist</p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>an vector array containing points in space which enclose all given points thus forming a hull </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  {</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="comment">// Initialize Result</span></div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Point></a> hull;</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// Find the leftmost point</span></div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">int</span> leftmost_point = 0;</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size; i++) {</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (points[i].x < points[leftmost_point].x) {</div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  leftmost_point = i;</div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  }</div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="comment">// Start from leftmost point, keep moving counterclockwise</span></div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// until reach the start point again. This loop runs O(h)</span></div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="comment">// times where h is number of points in result or output.</span></div>
|
||||
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordtype">int</span> p = leftmost_point, q = 0;</div>
|
||||
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">do</span> {</div>
|
||||
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// Add current point to result</span></div>
|
||||
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  hull.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(points[p]);</div>
|
||||
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
||||
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// Search for a point 'q' such that orientation(p, x, q)</span></div>
|
||||
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// is counterclockwise for all points 'x'. The idea</span></div>
|
||||
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// is to keep track of last visited most counter clock-</span></div>
|
||||
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// wise point in q. If any point 'i' is more counter clock-</span></div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// wise than q, then update q.</span></div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  q = (p + 1) % size;</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// If i is more counterclockwise than current q, then</span></div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// update q</span></div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">orientation</a>(points[p], points[i], points[q]) == 2) {</div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  q = i;</div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// Now q is the most counterclockwise with respect to p</span></div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// Set p as q for next iteration, so that q is added to</span></div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// result 'hull'</span></div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  p = q;</div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
||||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  } <span class="keywordflow">while</span> (p != leftmost_point); <span class="comment">// While we don't come to first point</span></div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> hull;</div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a878952f2eb3d1fae79d58c994fc10ab1_cgraph.svg" width="435" height="104"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a54df5f9a8f37170bd97c91127664655c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a54df5f9a8f37170bd97c91127664655c">◆ </a></span>orientation()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static int geometry::jarvis::Convexhull::orientation </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> & </td>
|
||||
<td class="paramname"><em>p</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> & </td>
|
||||
<td class="paramname"><em>q</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> & </td>
|
||||
<td class="paramname"><em>r</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>This function returns the geometric orientation for the three points in a space, ie, whether they are linear ir clockwise or anti-clockwise </p><dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">p</td><td>first point selected </td></tr>
|
||||
<tr><td class="paramname">q</td><td>adjacent point for q </td></tr>
|
||||
<tr><td class="paramname">r</td><td>adjacent point for q</td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 -> Linear </dd>
|
||||
<dd>
|
||||
1 -> Clock Wise </dd>
|
||||
<dd>
|
||||
2 -> Anti Clock Wise </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div>
|
||||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordtype">int</span> val = (q.y - p.<a class="code" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);</div>
|
||||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
||||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (val == 0) {</div>
|
||||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div>
|
||||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">return</span> (val > 0) ? 1 : 2;</div>
|
||||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<hr/>The documentation for this class was generated from the following file:<ul>
|
||||
<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<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 class="ttdoc">STL class.</div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
<div 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="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &p, const Point &q, const Point &r)</div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:133</div></div>
|
||||
<!-- 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>jarvis</b></li><li class="navelem"><a class="el" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
8
d4/dde/classgeometry_1_1jarvis_1_1_convexhull.js
Normal file
8
d4/dde/classgeometry_1_1jarvis_1_1_convexhull.js
Normal file
@@ -0,0 +1,8 @@
|
||||
var classgeometry_1_1jarvis_1_1_convexhull =
|
||||
[
|
||||
[ "Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870", null ],
|
||||
[ "getConvexHull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1", null ],
|
||||
[ "orientation", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c", null ],
|
||||
[ "points", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a835cd4cdc5a644abb84535197d753b02", null ],
|
||||
[ "size", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a2272bb62c35af959953b0ea06b010036", null ]
|
||||
];
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="geometry::jarvis::Convexhull::Convexhull" name="geometry::jarvis::Convexhull::Convexhull">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,193,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="241,13,357,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
04155bf1dcae306382b112c6b93afe05
|
||||
@@ -0,0 +1,38 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: geometry::jarvis::Convexhull::Convexhull Pages: 1 -->
|
||||
<svg width="272pt" height="39pt"
|
||||
viewBox="0.00 0.00 272.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>geometry::jarvis::Convexhull::Convexhull</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 268,-35 268,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 141,-30.5 141,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="70.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Convexhull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="177,-6 177,-25 264,-25 264,-6 177,-6"/>
|
||||
<text text-anchor="middle" x="220.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.17,-15.5C149.71,-15.5 158.32,-15.5 166.56,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="166.76,-19 176.76,-15.5 166.76,-12 166.76,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.8 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="geometry::jarvis::Convexhull::getConvexHull" name="geometry::jarvis::Convexhull::getConvexHull">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,35,193,76"/>
|
||||
<area shape="rect" id="node2" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="241,5,429,47"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="258,71,413,98"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
9d91bb1c4ff2967093f7768c4f95c422
|
||||
@@ -0,0 +1,54 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: geometry::jarvis::Convexhull::getConvexHull Pages: 1 -->
|
||||
<svg width="326pt" height="78pt"
|
||||
viewBox="0.00 0.00 326.00 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 73.5)">
|
||||
<title>geometry::jarvis::Convexhull::getConvexHull</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-73.5 322,-73.5 322,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-17 0,-47 141,-47 141,-17 0,-17"/>
|
||||
<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="70.5" y="-24" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="177,-39 177,-69 318,-69 318,-39 177,-39"/>
|
||||
<text text-anchor="start" x="185" y="-57" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
<text text-anchor="middle" x="247.5" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.17,-40.76C149.59,-41.82 158.25,-42.91 166.81,-43.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="166.43,-47.46 176.79,-45.24 167.3,-40.52 166.43,-47.46"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="189.5,-0.5 189.5,-19.5 305.5,-19.5 305.5,-0.5 189.5,-0.5"/>
|
||||
<text text-anchor="middle" x="247.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.17,-23.24C153.68,-21.67 166.7,-20.03 179.14,-18.47"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="179.95,-21.89 189.43,-17.17 179.07,-14.95 179.95,-21.89"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.7 KiB |
114
d5/d5f/namespacegeometry.html
Normal file
114
d5/d5f/namespacegeometry.html
Normal file
@@ -0,0 +1,114 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: geometry Namespace 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d5/d5f/namespacegeometry.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 Namespace Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Geometry algorithms.
|
||||
<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></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="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
7
d5/d5f/namespacegeometry.js
Normal file
7
d5/d5f/namespacegeometry.js
Normal file
@@ -0,0 +1,7 @@
|
||||
var namespacegeometry =
|
||||
[
|
||||
[ "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", "d9/d5a/structgeometry_1_1jarvis_1_1_point" ]
|
||||
] ]
|
||||
];
|
||||
114
d5/da7/namespacejarvis.html
Normal file
114
d5/da7/namespacejarvis.html
Normal file
@@ -0,0 +1,114 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: jarvis Namespace 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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d5/da7/namespacejarvis.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">jarvis Namespace Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm.
|
||||
<a href="../../d5/da7/namespacejarvis.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. </p>
|
||||
</div></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/da7/namespacejarvis.html">jarvis</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -136,7 +136,7 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
|
||||
<p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
|
||||
<h3><a class="anchor" id="autotoc_md43"></a>
|
||||
<h3><a class="anchor" id="autotoc_md44"></a>
|
||||
Algorithm</h3>
|
||||
<p>Shuffle the array untill array is sorted.</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>
|
||||
|
||||
127
d9/d5a/structgeometry_1_1jarvis_1_1_point.html
Normal file
127
d9/d5a/structgeometry_1_1jarvis_1_1_point.html
Normal file
@@ -0,0 +1,127 @@
|
||||
<!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=9"/>
|
||||
<meta name="generator" content="Doxygen 1.8.18"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: geometry::jarvis::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">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.8.18 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
|
||||
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d9/d5a/structgeometry_1_1jarvis_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> |
|
||||
<a href="../../d2/d36/structgeometry_1_1jarvis_1_1_point-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">geometry::jarvis::Point Struct Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:af14ad1652ac763c92e5c79a86796d044"><td class="memItemLeft" align="right" valign="top"><a id="af14ad1652ac763c92e5c79a86796d044"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
|
||||
<tr class="separator:af14ad1652ac763c92e5c79a86796d044"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a6c52f5bd4f7360d2d1db0bf6537a10e0"><td class="memItemLeft" align="right" valign="top"><a id="a6c52f5bd4f7360d2d1db0bf6537a10e0"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
|
||||
<tr class="separator:a6c52f5bd4f7360d2d1db0bf6537a10e0"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Structure defining the x and y co-ordinates of the given point in space </p>
|
||||
</div><hr/>The documentation for this struct was generated from the following file:<ul>
|
||||
<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d5/d5f/namespacegeometry.html">geometry</a></li><li class="navelem"><b>jarvis</b></li><li class="navelem"><a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a></li>
|
||||
<li class="footer">Generated by
|
||||
<a href="http://www.doxygen.org/index.html">
|
||||
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
5
d9/d5a/structgeometry_1_1jarvis_1_1_point.js
Normal file
5
d9/d5a/structgeometry_1_1jarvis_1_1_point.js
Normal file
@@ -0,0 +1,5 @@
|
||||
var structgeometry_1_1jarvis_1_1_point =
|
||||
[
|
||||
[ "x", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html#af14ad1652ac763c92e5c79a86796d044", null ],
|
||||
[ "y", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html#a6c52f5bd4f7360d2d1db0bf6537a10e0", null ]
|
||||
];
|
||||
@@ -0,0 +1,5 @@
|
||||
<map id="geometry::jarvis::Convexhull" name="geometry::jarvis::Convexhull">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,199,193,225"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="24,95,175,136"/>
|
||||
<area shape="rect" id="node3" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="23,5,176,32"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
b5b9bdb210c61fea80c27a247d8cec3e
|
||||
@@ -0,0 +1,55 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: geometry::jarvis::Convexhull Pages: 1 -->
|
||||
<svg width="149pt" height="173pt"
|
||||
viewBox="0.00 0.00 149.00 173.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 169)">
|
||||
<title>geometry::jarvis::Convexhull</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-169 145,-169 145,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 141,-19.5 141,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="70.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="14,-67.5 14,-97.5 127,-97.5 127,-67.5 14,-67.5"/>
|
||||
<text text-anchor="start" x="22" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< geometry</text>
|
||||
<text text-anchor="middle" x="70.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">::jarvis::Point ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M70.5,-57.09C70.5,-44.21 70.5,-29.2 70.5,-19.89"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="67,-57.23 70.5,-67.23 74,-57.23 67,-57.23"/>
|
||||
<text text-anchor="middle" x="85.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00"> points</text>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="13,-145.5 13,-164.5 128,-164.5 128,-145.5 13,-145.5"/>
|
||||
<text text-anchor="middle" x="70.5" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Point</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M70.5,-135.24C70.5,-123.41 70.5,-108.38 70.5,-97.58"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="67,-135.36 70.5,-145.36 74,-135.36 67,-135.36"/>
|
||||
<text text-anchor="middle" x="92" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00"> elements</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.7 KiB |
@@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_e3380d2178455503f266746fb14246a5.h
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
|
||||
Files</h2></td></tr>
|
||||
<tr class="memitem:d4/d8d/jarvis__algorithm_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></td></tr>
|
||||
<tr class="memdesc:d4/d8d/jarvis__algorithm_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/d6c/line__segment__intersection_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></td></tr>
|
||||
<tr class="memdesc:d8/d6c/line__segment__intersection_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">check whether two line segments intersect each other or not. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
|
||||
@@ -1,4 +1,5 @@
|
||||
var dir_e3380d2178455503f266746fb14246a5 =
|
||||
[
|
||||
[ "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" ]
|
||||
];
|
||||
@@ -122,7 +122,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); });
|
||||
<tr id="row_2_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d7/de0/stack_8h.html" target="_self">stack.h</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
|
||||
<tr id="row_2_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
|
||||
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">►</span><span id="img_3_" class="iconfclosed" onclick="toggleFolder('3_')"> </span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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">Jarvis’s</a> algorithm </td></tr>
|
||||
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_4_" class="arrow" onclick="toggleFolder('4_')">►</span><span id="img_4_" class="iconfclosed" onclick="toggleFolder('4_')"> </span><a class="el" href="dir_12552d7fa429bf94a2e32e5cf39f7e69.html" target="_self">graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>
|
||||
<tr id="row_4_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="df/ddd/connected__components_8cpp.html" target="_self">connected_components.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">Graph Connected Components (Connected Components)</a> </td></tr>
|
||||
|
||||
@@ -154,6 +154,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
<li>Complex()
|
||||
: <a class="el" href="da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex</a>
|
||||
</li>
|
||||
<li>Convexhull()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -261,6 +264,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
<li>getAdjList()
|
||||
: <a class="el" href="da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d">Graph</a>
|
||||
</li>
|
||||
<li>getConvexHull()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
<li>getMin()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">MinHeap</a>
|
||||
</li>
|
||||
@@ -268,7 +274,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
: <a class="el" href="da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph</a>
|
||||
</li>
|
||||
<li>Graph()
|
||||
: <a class="el" href="da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a>
|
||||
: <a class="el" href="da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a>
|
||||
, <a class="el" href="dc/d61/classgraph_1_1_graph.html#a34414f67c2e3ea89774839b36b1575f8">graph::Graph</a>
|
||||
, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a477bf401cab737bb313f687b08fff082">graph::is_graph_bipartite::Graph</a>
|
||||
</li>
|
||||
@@ -468,6 +474,9 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
|
||||
<li>operator~()
|
||||
: <a class="el" href="da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex</a>
|
||||
</li>
|
||||
<li>orientation()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
@@ -135,6 +135,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>Complex()
|
||||
: <a class="el" href="da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex</a>
|
||||
</li>
|
||||
<li>Convexhull()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
@@ -233,6 +236,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>getAdjList()
|
||||
: <a class="el" href="da/d9a/class_graph.html#a6cb6fbec4ea7cfdfda368f2c468a757d">Graph</a>
|
||||
</li>
|
||||
<li>getConvexHull()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a878952f2eb3d1fae79d58c994fc10ab1">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
<li>getMin()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">MinHeap</a>
|
||||
</li>
|
||||
@@ -386,6 +392,9 @@ $(document).ready(function(){initNavTree('functions_func.html',''); initResizabl
|
||||
<li>operator~()
|
||||
: <a class="el" href="da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex</a>
|
||||
</li>
|
||||
<li>orientation()
|
||||
: <a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull</a>
|
||||
</li>
|
||||
</ul>
|
||||
|
||||
|
||||
|
||||
@@ -98,17 +98,17 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knight_tour.cpp</a>
|
||||
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jarvis_algorithm.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.cpp</a>
|
||||
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
|
||||
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
|
||||
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
|
||||
, <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brute_force_string_searching.cpp</a>
|
||||
@@ -153,15 +153,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
|
||||
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">xor_cipher.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bisection_method.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sum_of_digits.cpp</a>
|
||||
@@ -185,15 +185,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
|
||||
, <a class="el" href="d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">avltree.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
@@ -202,6 +202,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
|
||||
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
|
||||
@@ -99,20 +99,22 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
<li>test()
|
||||
: <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">xor_cipher.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">double_factorial.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">gnome_sort.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">double_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">jarvis_algorithm.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">gnome_sort.cpp</a>
|
||||
, <a class="el" href="d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">heap_sort.cpp</a>
|
||||
</li>
|
||||
<li>test1()
|
||||
: <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">hamiltons_cycle.cpp</a>
|
||||
: <a class="el" href="d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">hill_cipher.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.cpp</a>
|
||||
@@ -123,10 +125,10 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">lu_decompose.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">hill_cipher.cpp</a>
|
||||
</li>
|
||||
<li>test2()
|
||||
: <a class="el" href="d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">large_factorial.cpp</a>
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">large_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">durand_kerner_roots.cpp</a>
|
||||
@@ -138,16 +140,15 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.cpp</a>
|
||||
</li>
|
||||
<li>test3()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.cpp</a>
|
||||
: <a class="el" href="d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">smallest_circle.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">smallest_circle.cpp</a>
|
||||
</li>
|
||||
<li>test_2d_classes()
|
||||
: <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">kohonen_som_topology.cpp</a>
|
||||
@@ -174,25 +175,25 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
: <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a>
|
||||
</li>
|
||||
<li>test_int()
|
||||
: <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
: <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
, <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
</li>
|
||||
<li>test_lamniscate()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
: <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
@@ -98,29 +98,29 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knight_tour.cpp</a>
|
||||
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jarvis_algorithm.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
, <a class="el" href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gaussian_elimination.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">lu_decompose.cpp</a>
|
||||
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
|
||||
, <a class="el" href="de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">binary_exponent.cpp</a>
|
||||
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">newton_raphson_method.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_forward_euler.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_midpoint_euler.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">ode_semi_implicit_euler.cpp</a>
|
||||
, <a class="el" href="d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">xor_cipher.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">check_prime.cpp</a>
|
||||
, <a class="el" href="d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">qr_decomposition.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">complex_numbers.cpp</a>
|
||||
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
|
||||
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
|
||||
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
|
||||
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
|
||||
, <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brute_force_string_searching.cpp</a>
|
||||
@@ -158,22 +158,22 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">pascal_triangle.cpp</a>
|
||||
, <a class="el" href="da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">palindrome_of_number.cpp</a>
|
||||
, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">matrix_exponentiation.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_roman_numeral.cpp</a>
|
||||
, <a class="el" href="d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_interger_input.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">happy_number.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_factorial.cpp</a>
|
||||
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>
|
||||
, <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">decimal_to_roman_numeral.cpp</a>
|
||||
, <a class="el" href="da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">eulers_totient_function.cpp</a>
|
||||
, <a class="el" href="d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_interger_input.cpp</a>
|
||||
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
|
||||
, <a class="el" href="d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">avltree.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
|
||||
, <a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">extended_euclid_algorithm.cpp</a>
|
||||
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
|
||||
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">false_position.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bisection_method.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sum_of_digits.cpp</a>
|
||||
@@ -190,25 +190,26 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">miller_rabin.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
|
||||
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
|
||||
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
|
||||
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
|
||||
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
|
||||
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
|
||||
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
|
||||
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
|
||||
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
|
||||
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hill_cipher.cpp</a>
|
||||
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
, <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ordinary_least_squares_regressor.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
|
||||
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
|
||||
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.cpp</a>
|
||||
</li>
|
||||
<li>mat_mul()
|
||||
: <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0">qr_eigen_values.cpp</a>
|
||||
|
||||
@@ -99,20 +99,22 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
<li>test()
|
||||
: <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">caesar_cipher.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">xor_cipher.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">double_factorial.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">gnome_sort.cpp</a>
|
||||
, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">check_amicable_pair.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">double_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">jarvis_algorithm.cpp</a>
|
||||
, <a class="el" href="d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">fibonacci.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">is_graph_bipartite.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">armstrong_number.cpp</a>
|
||||
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">gnome_sort.cpp</a>
|
||||
, <a class="el" href="d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">heap_sort.cpp</a>
|
||||
</li>
|
||||
<li>test1()
|
||||
: <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">hamiltons_cycle.cpp</a>
|
||||
: <a class="el" href="d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">hill_cipher.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">kohonen_som_trace.cpp</a>
|
||||
@@ -123,10 +125,10 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">lu_decompose.cpp</a>
|
||||
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">qr_eigen_values.cpp</a>
|
||||
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">hill_cipher.cpp</a>
|
||||
</li>
|
||||
<li>test2()
|
||||
: <a class="el" href="d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">large_factorial.cpp</a>
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">large_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">sum_of_digits.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">durand_kerner_roots.cpp</a>
|
||||
@@ -138,16 +140,15 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">kohonen_som_trace.cpp</a>
|
||||
</li>
|
||||
<li>test3()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.cpp</a>
|
||||
: <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">smallest_circle.cpp</a>
|
||||
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">hamiltons_cycle.cpp</a>
|
||||
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">adaline_learning.cpp</a>
|
||||
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_topology.cpp</a>
|
||||
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">kohonen_som_trace.cpp</a>
|
||||
, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">brent_method_extrema.cpp</a>
|
||||
, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">golden_search_extrema.cpp</a>
|
||||
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">smallest_circle.cpp</a>
|
||||
</li>
|
||||
<li>test_2d_classes()
|
||||
: <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">kohonen_som_topology.cpp</a>
|
||||
@@ -174,8 +175,8 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
: <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a>
|
||||
</li>
|
||||
<li>test_int()
|
||||
: <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
: <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a>
|
||||
, <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>
|
||||
</li>
|
||||
<li>test_lamniscate()
|
||||
: <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60">kohonen_som_trace.cpp</a>
|
||||
@@ -184,18 +185,18 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
: <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a>
|
||||
</li>
|
||||
<li>tests()
|
||||
: <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
: <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>
|
||||
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>
|
||||
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">breadth_first_search.cpp</a>
|
||||
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>
|
||||
, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>
|
||||
, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>
|
||||
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>
|
||||
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>
|
||||
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>
|
||||
, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>
|
||||
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>
|
||||
</li>
|
||||
<li>TH()
|
||||
: <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a>
|
||||
|
||||
@@ -103,47 +103,49 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
|
||||
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_3_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_5_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_7_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_8_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;"> </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::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher">Hill Cipher</a> algorithm </td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6f/structdata__structure_1_1_node.html" target="_self">data_structure::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html" target="_self">data_structure::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_11_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
|
||||
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher">Hill Cipher</a> algorithm </td></tr>
|
||||
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6f/structdata__structure_1_1_node.html" target="_self">data_structure::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d46/classdata__structure_1_1_skip_list.html" target="_self">data_structure::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </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< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dd9/structtrie.html" target="_self">trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_46_"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -5,12 +5,13 @@ var hierarchy =
|
||||
[ "cll", "d5/d15/classcll.html", null ],
|
||||
[ "compare", "d1/db3/structcompare.html", null ],
|
||||
[ "Complex", "da/d5a/class_complex.html", null ],
|
||||
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
|
||||
[ "CycleCheck", "d3/dbb/class_cycle_check.html", null ],
|
||||
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
|
||||
[ "Edge", "d7/d77/class_edge.html", null ],
|
||||
[ "linear_probing::Entry", "db/d19/structlinear__probing_1_1_entry.html", null ],
|
||||
[ "quadratic_probing::Entry", "da/dd1/structquadratic__probing_1_1_entry.html", null ],
|
||||
[ "double_hashing::Entry", "d9/dde/structdouble__hashing_1_1_entry.html", null ],
|
||||
[ "quadratic_probing::Entry", "da/dd1/structquadratic__probing_1_1_entry.html", null ],
|
||||
[ "FenwickTree", "dd/d91/class_fenwick_tree.html", null ],
|
||||
[ "Graph", "da/d9a/class_graph.html", null ],
|
||||
[ "graph::is_graph_bipartite::Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", null ],
|
||||
@@ -27,11 +28,12 @@ var hierarchy =
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", null ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
|
||||
[ "mst", "d1/d77/structmst.html", null ],
|
||||
[ "data_structure::Node", "d3/d6f/structdata__structure_1_1_node.html", null ],
|
||||
[ "node< Kind >", "d5/da1/structnode.html", null ],
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "node< Kind >", "d5/da1/structnode.html", null ],
|
||||
[ "data_structure::Node", "d3/d6f/structdata__structure_1_1_node.html", null ],
|
||||
[ "node< Type >", "d5/da1/structnode.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", null ],
|
||||
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue< Kind >", "db/da9/classqueue.html", null ],
|
||||
|
||||
@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
|
||||
<div class="contents">
|
||||
<div class="textblock"><p><a class="anchor" id="mainpage"></a></p>
|
||||
<p><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://lgtm.com/projects/g/TheAlgorithms/C-Plus-Plus/context:cpp"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C-Plus-Plus.svg?logo=lgtm&logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&logo=gitter&style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md"><img src="https://img.shields.io/static/v1.svg?label=Contributions&message=Welcome&color=0059b3&style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C-Plus-Plus?color=red&style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C-Plus-Plus"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions?query=workflow%3A%22Awesome+CI+Workflow%22"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a></p>
|
||||
<h1><a class="anchor" id="autotoc_md39"></a>
|
||||
<h1><a class="anchor" id="autotoc_md40"></a>
|
||||
Overview</h1>
|
||||
<p>The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/LICENSE">MIT License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.</p>
|
||||
<h1><a class="anchor" id="autotoc_md40"></a>
|
||||
<h1><a class="anchor" id="autotoc_md41"></a>
|
||||
Features</h1>
|
||||
<ul>
|
||||
<li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C%2B%2B">C++</a>.</li>
|
||||
@@ -110,12 +110,12 @@ Features</h1>
|
||||
<li>Self-checks within programs ensure correct implementations with confidence.</li>
|
||||
<li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md41"></a>
|
||||
<h1><a class="anchor" id="autotoc_md42"></a>
|
||||
Documentation</h1>
|
||||
<p><a href="https://TheAlgorithms.github.io/C-Plus-Plus">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on <a href="https://TheAlgorithms.github.io/C-Plus-Plus/files.html">Files menu</a> to see the list of all the files documented with the code.</p>
|
||||
<p><a href="https://thealgorithms.github.io/C-Plus-Plus">Documentation of Algorithms in C++</a> by <a href="https://github.com/TheAlgorithms/C-Plus-Plus/graphs/contributors">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1">CC BY-SA 4.0</a><br />
|
||||
<a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
|
||||
<h1><a class="anchor" id="autotoc_md42"></a>
|
||||
<h1><a class="anchor" id="autotoc_md43"></a>
|
||||
Contributions</h1>
|
||||
<p>As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md">Contribution Guidelines</a>. </p>
|
||||
</div></div><!-- PageDoc -->
|
||||
|
||||
@@ -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,63,32"/>
|
||||
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,193,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
4eeb1b22e1ab39b25c3d6d16904bf56f
|
||||
6940f502400c229af84789c6c00f1735
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="51pt" height="28pt"
|
||||
viewBox="0.00 0.00 51.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="149pt" height="28pt"
|
||||
viewBox="0.00 0.00 149.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 47,-24 47,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 145,-24 145,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 43,-19.5 43,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="21.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</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 141,-19.5 141,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="70.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 992 B After Width: | Height: | Size: 1.0 KiB |
@@ -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,103,32"/>
|
||||
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="151,5,281,32"/>
|
||||
<area shape="rect" id="node1" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="5,5,159,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
87e5359d2bddb6db2cd1fca274800de1
|
||||
595208590648226e9aacf172b391904d
|
||||
@@ -4,34 +4,19 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="215pt" height="28pt"
|
||||
viewBox="0.00 0.00 215.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 211,-24 211,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="dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 73,-19.5 73,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::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>
|
||||
<!-- 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="109,-0.5 109,-19.5 207,-19.5 207,-0.5 109,-0.5"/>
|
||||
<text text-anchor="middle" x="158" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M83.11,-10C91.58,-10 100.46,-10 108.99,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="83.03,-6.5 73.03,-10 83.03,-13.5 83.03,-6.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.7 KiB After Width: | Height: | Size: 1.0 KiB |
@@ -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,169,47"/>
|
||||
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,63,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
caa13fcf076ba3470984229bfbfdc7c1
|
||||
4eeb1b22e1ab39b25c3d6d16904bf56f
|
||||
@@ -4,18 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="131pt" height="39pt"
|
||||
viewBox="0.00 0.00 131.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="51pt" height="28pt"
|
||||
viewBox="0.00 0.00 51.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 127,-35 127,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 47,-24 47,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 123,-30.5 123,-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="61.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</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 43,-19.5 43,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="21.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 992 B |
@@ -1,3 +1,4 @@
|
||||
<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,215,32"/>
|
||||
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,103,32"/>
|
||||
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="151,5,281,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
bafb3280f8e20dc1a7424343016b176d
|
||||
87e5359d2bddb6db2cd1fca274800de1
|
||||
@@ -4,19 +4,34 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="165pt" height="28pt"
|
||||
viewBox="0.00 0.00 165.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="215pt" height="28pt"
|
||||
viewBox="0.00 0.00 215.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 161,-24 161,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 211,-24 211,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 157,-19.5 157,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</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 73,-19.5 73,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::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="109,-0.5 109,-19.5 207,-19.5 207,-0.5 109,-0.5"/>
|
||||
<text text-anchor="middle" x="158" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M83.11,-10C91.58,-10 100.46,-10 108.99,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="83.03,-6.5 73.03,-10 83.03,-13.5 83.03,-6.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.7 KiB |
@@ -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,93,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,169,47"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
6a0f93ba427d9329d424820da1078327
|
||||
caa13fcf076ba3470984229bfbfdc7c1
|
||||
@@ -4,17 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="74pt" height="28pt"
|
||||
viewBox="0.00 0.00 74.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="131pt" height="39pt"
|
||||
viewBox="0.00 0.00 131.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 70,-24 70,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 127,-35 127,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 66,-19.5 66,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="33" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</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 123,-30.5 123,-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="61.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.2 KiB |
@@ -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="$d9/d23/classgraph_1_1_lowest_common_ancestor.html" title=" " alt="" coords="5,5,215,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
458fe77fc737dff37fe3ca54afe8d9fd
|
||||
bafb3280f8e20dc1a7424343016b176d
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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="165pt" height="28pt"
|
||||
viewBox="0.00 0.00 165.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 161,-24 161,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="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 157,-19.5 157,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 989 B After Width: | Height: | Size: 1.0 KiB |
@@ -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,105,32"/>
|
||||
<area shape="rect" id="node1" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,93,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
020117a75ed9e535ed2f6e9057f8e61f
|
||||
6a0f93ba427d9329d424820da1078327
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="83pt" height="28pt"
|
||||
viewBox="0.00 0.00 83.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="74pt" height="28pt"
|
||||
viewBox="0.00 0.00 74.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 79,-24 79,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 70,-24 70,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 75,-19.5 75,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</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 66,-19.5 66,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="33" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1006 B After Width: | Height: | Size: 1.0 KiB |
@@ -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,147,32"/>
|
||||
<area shape="rect" id="node1" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
798897e4b583c00fbe8c88f7e5f1551d
|
||||
458fe77fc737dff37fe3ca54afe8d9fd
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="114pt" height="28pt"
|
||||
viewBox="0.00 0.00 114.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 110,-24 110,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/d19/structlinear__probing_1_1_entry.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 106,-19.5 106,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="53" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::Entry</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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 989 B |
@@ -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/d82/classlarge__number.html" title=" " alt="" coords="5,5,105,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
5fc9ec91cf1ed515d3e948f26519c17a
|
||||
020117a75ed9e535ed2f6e9057f8e61f
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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="83pt" height="28pt"
|
||||
viewBox="0.00 0.00 83.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 79,-24 79,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/d82/classlarge__number.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 75,-19.5 75,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1002 B After Width: | Height: | Size: 1006 B |
@@ -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="$db/d19/structlinear__probing_1_1_entry.html" title=" " alt="" coords="5,5,147,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e6fa82a0e450cb795421ea95e90b2fe6
|
||||
798897e4b583c00fbe8c88f7e5f1551d
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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="114pt" height="28pt"
|
||||
viewBox="0.00 0.00 114.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 110,-24 110,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="db/d19/structlinear__probing_1_1_entry.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 106,-19.5 106,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="53" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::Entry</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 990 B After Width: | Height: | Size: 1.0 KiB |
@@ -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,177,32"/>
|
||||
<area shape="rect" id="node1" href="$d0/dff/structlinkedlist.html" title=" " alt="" coords="5,5,79,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a4563c6e45ac1fa78e07acb60fc5fa50
|
||||
5fc9ec91cf1ed515d3e948f26519c17a
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="137pt" height="28pt"
|
||||
viewBox="0.00 0.00 137.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 133,-24 133,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="d6/d30/classmachine__learning_1_1adaline.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 129,-19.5 129,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="64.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1002 B |
@@ -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,80,32"/>
|
||||
<area shape="rect" id="node1" href="$d8/d10/structlist.html" title=" " alt="" coords="5,5,44,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
20a3344e5b7c2798c614a5832bb050be
|
||||
e6fa82a0e450cb795421ea95e90b2fe6
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="64pt" height="28pt"
|
||||
viewBox="0.00 0.00 64.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 60,-24 60,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="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</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>
|
||||
|
||||
|
Before Width: | Height: | Size: 995 B After Width: | Height: | Size: 990 B |
@@ -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,111,32"/>
|
||||
<area shape="rect" id="node1" href="$d6/d30/classmachine__learning_1_1adaline.html" title=" " alt="" coords="5,5,177,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
b7390394bbaa0abd74424ba9a880f9e2
|
||||
a4563c6e45ac1fa78e07acb60fc5fa50
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="87pt" height="28pt"
|
||||
viewBox="0.00 0.00 87.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="137pt" height="28pt"
|
||||
viewBox="0.00 0.00 137.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 83,-24 83,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 133,-24 133,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 79,-19.5 79,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="39.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</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 129,-19.5 129,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="64.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1007 B After Width: | Height: | Size: 1.0 KiB |
@@ -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="$d2/d05/class_min_heap.html" title=" " alt="" coords="5,5,80,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
dac11be16a53d20641c8a15ac8df90c8
|
||||
20a3344e5b7c2798c614a5832bb050be
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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="64pt" height="28pt"
|
||||
viewBox="0.00 0.00 64.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 60,-24 60,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="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 988 B After Width: | Height: | Size: 995 B |
@@ -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="$d5/d29/struct_min_heap_node.html" title=" " alt="" coords="5,5,111,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
345302fd1e3a1df4f5d11eaae31127fd
|
||||
b7390394bbaa0abd74424ba9a880f9e2
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- 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="87pt" height="28pt"
|
||||
viewBox="0.00 0.00 87.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 83,-24 83,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="d5/d29/struct_min_heap_node.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 79,-19.5 79,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="39.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 989 B After Width: | Height: | Size: 1007 B |
@@ -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,105,32"/>
|
||||
<area shape="rect" id="node1" href="$d1/d77/structmst.html" title=" " alt="" coords="5,5,49,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ed0ff6113ee370c2e2e0573042492713
|
||||
dac11be16a53d20641c8a15ac8df90c8
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="83pt" height="28pt"
|
||||
viewBox="0.00 0.00 83.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 79,-24 79,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="d5/da1/structnode.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 75,-19.5 75,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node< Kind ></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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1004 B After Width: | Height: | Size: 988 B |
@@ -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,108,32"/>
|
||||
<area shape="rect" id="node1" href="$db/d8b/struct_node.html" title=" " alt="" coords="5,5,59,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
6fbc15d6c56b357e585d5a6e4c7ecac2
|
||||
345302fd1e3a1df4f5d11eaae31127fd
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="85pt" height="28pt"
|
||||
viewBox="0.00 0.00 85.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 81,-24 81,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 77,-19.5 77,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="38.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node< Type ></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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1004 B After Width: | Height: | Size: 989 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d8/dc8/struct_point.html" title=" " alt="" coords="5,5,57,32"/>
|
||||
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,105,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
38884a151d472065dcd8a6fcae7b35c8
|
||||
ed0ff6113ee370c2e2e0573042492713
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="47pt" height="28pt"
|
||||
viewBox="0.00 0.00 47.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="83pt" height="28pt"
|
||||
viewBox="0.00 0.00 83.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 43,-24 43,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 79,-24 79,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d8/dc8/struct_point.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 39,-19.5 39,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Point</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 75,-19.5 75,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node< Kind ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 993 B After Width: | Height: | Size: 1004 B |
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user