mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-06-10 03:25:35 +08:00
Documentation for 5b238724b8
This commit is contained in:
github-actions
243
annotated.html
243
annotated.html
@@ -130,128 +130,131 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_11_" class="even" style="display:none;"><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/d3e/classdata__structures_1_1trie.html" target="_self">trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
|
||||
<tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </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" target="_blank">double hashing</a> algorithm </td></tr>
|
||||
<tr id="row_2_0_" class="odd" style="display:none;"><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_" class="odd"><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">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_3_0_" class="arrow" onclick="toggleFolder('3_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>grahamscan</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_3_1_" class="arrow" onclick="toggleFolder('3_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">Convexhull</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_3_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </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="odd" style="display:none;"><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_" class="odd" style="display:none;"><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="odd" style="display:none;"><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_" class="odd" style="display:none;"><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/d69/classgraph_1_1_h_k_graph.html" target="_self">HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
|
||||
<tr id="row_4_3_" class="odd" style="display:none;"><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_4_" class="odd" style="display:none;"><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_" class="odd"><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" target="_blank">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_5_0_" class="even" style="display:none;"><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_" class="even"><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"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </td></tr>
|
||||
<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_0_" class="arrow" onclick="toggleFolder('6_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>aystar_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_0_0_" class="arrow" onclick="toggleFolder('6_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_self">AyStarSearch</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state </td></tr>
|
||||
<tr id="row_6_0_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
|
||||
<tr id="row_6_0_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
|
||||
<tr id="row_6_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">EightPuzzle</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
|
||||
<tr id="row_6_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_6_1_" class="arrow" onclick="toggleFolder('6_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>neural_network</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_6_1_0_" class="arrow" onclick="toggleFolder('6_1_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>layers</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_1_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_1_1_" class="odd" style="display:none;"><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/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_6_2_" class="odd" style="display:none;"><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_" class="odd"><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="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_7_1_" class="even" style="display:none;"><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/d4f/structmath_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_" class="even"><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="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
|
||||
<tr id="row_8_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_8_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_1_" class="arrow" onclick="toggleFolder('8_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>inorder_traversal_of_bst</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
|
||||
<tr id="row_8_2_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_2_" class="arrow" onclick="toggleFolder('8_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>reverse_binary_tree</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_2_0_" class="odd" style="display:none;"><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/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
|
||||
<tr id="row_8_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_8_3_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_3_" class="arrow" onclick="toggleFolder('8_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_3_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>vector</code> </td></tr>
|
||||
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_0_" class="arrow" onclick="toggleFolder('9_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_0_0_" class="even" style="display:none;"><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/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_9_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
|
||||
<tr id="row_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_1_" class="arrow" onclick="toggleFolder('9_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>lru_cache</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
|
||||
<tr id="row_9_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_2_" class="arrow" onclick="toggleFolder('9_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_2_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_9_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_3_" class="arrow" onclick="toggleFolder('9_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>recursive_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_9_3_1_" class="even" style="display:none;"><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/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
|
||||
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">Probability algorithms </td></tr>
|
||||
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_0_" class="arrow" onclick="toggleFolder('10_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>geometric_dist</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
|
||||
<tr id="row_10_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_1_" class="arrow" onclick="toggleFolder('10_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>windowed_median</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
|
||||
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">►</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" target="_blank">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_11_0_" class="even" style="display:none;"><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_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
|
||||
<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_12_0_1_" class="odd" style="display:none;"><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/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
|
||||
<tr id="row_12_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
|
||||
<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_12_1_" class="arrow" onclick="toggleFolder('12_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
|
||||
<tr id="row_12_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_13_0_" class="arrow" onclick="toggleFolder('13_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
|
||||
<tr id="row_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">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_14_0_" class="odd" style="display:none;"><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_14_1_" class="odd" style="display:none;"><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_15_" class="odd"><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">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_1_" class="even" style="display:none;"><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/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_3_" class="even" style="display:none;"><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/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
|
||||
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
|
||||
<tr id="row_17_" class="odd"><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_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="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="odd"><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/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
|
||||
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="odd"><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_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="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="odd"><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_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="dd/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
|
||||
<tr id="row_25_" class="odd"><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/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </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="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="odd"><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/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </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/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="odd"><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_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="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_31_" class="odd"><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_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="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="odd"><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_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="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_" class="odd"><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/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </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/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_" class="odd"><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_38_" 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_39_" class="odd"><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_2_" class="even"><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="dd/dba/namespacedivide__and__conquer.html" target="_self">divide_and_conquer</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_2_0_" class="arrow" onclick="toggleFolder('2_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>strassens_multiplication</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_2_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">Matrix</a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
|
||||
<tr id="row_3_" class="odd"><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="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm </td></tr>
|
||||
<tr id="row_3_0_" class="even" style="display:none;"><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_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 class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_4_0_" class="odd" style="display:none;"><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>grahamscan</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_4_1_" class="arrow" onclick="toggleFolder('4_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_4_1_0_" class="odd" style="display:none;"><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_4_1_1_" class="odd" style="display:none;"><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_5_" class="odd"><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="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_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_5_0_" class="arrow" onclick="toggleFolder('5_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_5_0_0_" class="even" style="display:none;"><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_5_1_" class="even" style="display:none;"><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_5_2_" class="even" style="display:none;"><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/d69/classgraph_1_1_h_k_graph.html" target="_self">HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
|
||||
<tr id="row_5_3_" class="even" style="display:none;"><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_5_4_" class="even" style="display:none;"><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_6_" class="even"><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/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" target="_blank">linear probing</a> algorithm </td></tr>
|
||||
<tr id="row_6_0_" class="odd" style="display:none;"><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_7_" class="odd"><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="d8/d77/namespacemachine__learning.html" target="_self">machine_learning</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </td></tr>
|
||||
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>aystar_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_7_0_0_" class="arrow" onclick="toggleFolder('7_0_0_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_self">AyStarSearch</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state </td></tr>
|
||||
<tr id="row_7_0_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
|
||||
<tr id="row_7_0_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
|
||||
<tr id="row_7_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">EightPuzzle</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
|
||||
<tr id="row_7_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_7_1_" class="arrow" onclick="toggleFolder('7_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>neural_network</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_7_1_0_" class="arrow" onclick="toggleFolder('7_1_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>layers</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_1_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_1_1_" class="even" style="display:none;"><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/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_7_2_" class="even" style="display:none;"><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_8_" class="even"><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="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_8_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_8_1_" class="odd" style="display:none;"><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/d4f/structmath_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_0_" class="arrow" onclick="toggleFolder('9_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
|
||||
<tr id="row_9_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_1_" class="arrow" onclick="toggleFolder('9_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>inorder_traversal_of_bst</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
|
||||
<tr id="row_9_2_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_2_" class="arrow" onclick="toggleFolder('9_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>reverse_binary_tree</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_2_0_" class="even" style="display:none;"><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/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
|
||||
<tr id="row_9_2_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_9_3_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_9_3_" class="arrow" onclick="toggleFolder('9_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_9_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>vector</code> </td></tr>
|
||||
<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_0_" class="arrow" onclick="toggleFolder('10_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_0_0_" class="odd" style="display:none;"><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/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_10_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
|
||||
<tr id="row_10_1_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_1_" class="arrow" onclick="toggleFolder('10_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>lru_cache</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
|
||||
<tr id="row_10_2_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_2_" class="arrow" onclick="toggleFolder('10_2_')">►</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_10_3_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_10_3_" class="arrow" onclick="toggleFolder('10_3_')">►</span><span class="icona"><span class="icon">N</span></span><b>recursive_tree_traversals</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_10_3_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </td></tr>
|
||||
<tr id="row_10_3_1_" class="odd" style="display:none;"><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/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
|
||||
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">Probability algorithms </td></tr>
|
||||
<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>geometric_dist</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_11_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
|
||||
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_11_1_" class="arrow" onclick="toggleFolder('11_1_')">►</span><span class="icona"><span class="icon">N</span></span><b>windowed_median</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_11_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
|
||||
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">►</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" target="_blank">quadratic probing</a> algorithm </td></tr>
|
||||
<tr id="row_12_0_" class="odd" style="display:none;"><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_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
|
||||
<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_13_0_" class="arrow" onclick="toggleFolder('13_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_13_0_1_" class="even" style="display:none;"><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/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
|
||||
<tr id="row_13_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
|
||||
<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_13_1_" class="arrow" onclick="toggleFolder('13_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
|
||||
<tr id="row_13_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></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">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_14_0_" class="arrow" onclick="toggleFolder('14_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
|
||||
<tr id="row_15_" class="odd"><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">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_15_0_" class="even" style="display:none;"><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_15_1_" class="even" style="display:none;"><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_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_1_" class="odd" style="display:none;"><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/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_3_" class="odd" style="display:none;"><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/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_16_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_17_" class="arrow" onclick="toggleFolder('17_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
|
||||
<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
|
||||
<tr id="row_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="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="odd"><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_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="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
|
||||
<tr id="row_21_" class="odd"><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_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="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_23_" class="odd"><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_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="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="odd"><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/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </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="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_27_" class="odd"><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_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/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_29_" class="odd"><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_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="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_" class="odd"><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_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="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="odd"><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_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="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_" class="odd"><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_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="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_37_" class="odd"><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_38_" 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_39_" class="odd"><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_40_" 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">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
|
||||
<tr id="row_41_" class="odd"><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_42_" 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_43_" class="odd"><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_41_" class="odd"><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_42_" 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_43_" class="odd"><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_44_" 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_45_" class="odd"><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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_46_" 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_47_" class="odd"><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_48_" 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_49_" class="odd"><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_50_" 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/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
|
||||
<tr id="row_51_" class="odd"><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_52_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_52_" class="arrow" onclick="toggleFolder('52_')">►</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_52_0_" class="odd" style="display:none;"><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_53_" class="odd"><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/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
|
||||
<tr id="row_54_" 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/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
|
||||
<tr id="row_45_" class="odd"><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_46_" 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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_47_" class="odd"><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_48_" 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/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_49_" class="odd"><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_50_" 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/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_51_" class="odd"><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/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
|
||||
<tr id="row_52_" 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_53_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_53_" class="arrow" onclick="toggleFolder('53_')">►</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_53_0_" class="even" style="display:none;"><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_54_" 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/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
|
||||
<tr id="row_55_" class="odd"><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/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -37,6 +37,11 @@ var annotated_dup =
|
||||
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
|
||||
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ]
|
||||
] ],
|
||||
[ "divide_and_conquer", "dd/dba/namespacedivide__and__conquer.html", [
|
||||
[ "strassens_multiplication", null, [
|
||||
[ "Matrix", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix" ]
|
||||
] ]
|
||||
] ],
|
||||
[ "double_hashing", "d0/d65/namespacedouble__hashing.html", [
|
||||
[ "Entry", "d9/dde/structdouble__hashing_1_1_entry.html", "d9/dde/structdouble__hashing_1_1_entry" ]
|
||||
] ],
|
||||
@@ -171,12 +176,12 @@ var annotated_dup =
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
|
||||
[ "mst", "d1/d77/structmst.html", null ],
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "RBtree", "d8/d72/class_r_btree.html", null ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
|
||||
[ "Solution", "dd/d4f/class_solution.html", null ],
|
||||
|
||||
@@ -134,16 +134,16 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> (data_structures::list_array)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d7/da4/struct_list_node.html">ListNode</a></dd><dd><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>)</dd><dd><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">LRUCache</a> (others::lru_cache)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a id="letter_M" name="letter_M">M</a></dt>
|
||||
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
|
||||
<dd><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> (divide_and_conquer::strassens_multiplication)</dd><dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a id="letter_N" name="letter_N">N</a></dt>
|
||||
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
|
||||
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
|
||||
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="de/d4f/structmath_1_1_point.html">Point</a> (<a class="el" href="dd/d47/namespacemath.html">math</a>)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a id="letter_Q" name="letter_Q">Q</a></dt>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a id="letter_R" name="letter_R">R</a></dt>
|
||||
<dd><a class="el" href="d8/d72/class_r_btree.html">RBtree</a></dd><dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
|
||||
|
||||
@@ -101,11 +101,12 @@ $(document).ready(function(){initNavTree('d2/d90/namespacegreedy__algorithms.htm
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Greedy Algorithms.
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
|
||||
<a href="../../d2/d90/namespacegreedy__algorithms.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Greedy Algorithms. </p>
|
||||
<p>for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> for assert for INT_MAX </p>
|
||||
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
<p>for assert for INT_MAX for IO operations</p>
|
||||
<p>Greedy Algorithms </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
118
d3/d91/namespacestrassens__multiplication.html
Normal file
118
d3/d91/namespacestrassens__multiplication.html
Normal file
@@ -0,0 +1,118 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.9.6"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: strassens_multiplication 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 id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.6 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('d3/d91/namespacestrassens__multiplication.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">
|
||||
<div id="MSearchResults">
|
||||
<div class="SRPage">
|
||||
<div id="SRIndex">
|
||||
<div id="SRResults"></div>
|
||||
<div class="SRStatus" id="Loading">Loading...</div>
|
||||
<div class="SRStatus" id="Searching">Searching...</div>
|
||||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">strassens_multiplication Namespace Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Namespace for performing strassen's multiplication.
|
||||
<a href="../../d3/d91/namespacestrassens__multiplication.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Namespace for performing strassen's multiplication. </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="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,7 +1,7 @@
|
||||
<map id="range_queries/sparse_table.cpp" name="range_queries/sparse_table.cpp">
|
||||
<area shape="rect" id="node1" title="Implementation of Sparse Table data structure." alt="" coords="95,5,241,45"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,64,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="89,93,154,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="179,93,251,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="275,93,349,119"/>
|
||||
<area shape="rect" id="node1" title="Implementation of Sparse Table data structure." alt="" coords="111,5,257,45"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,80,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="105,93,170,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="195,93,267,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="291,93,349,119"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
488f94594ebd0a69fb5c6ebdfeb7e7ba
|
||||
4bb86a207e8714317c614032f142f355
|
||||
@@ -12,9 +12,9 @@
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Implementation of Sparse Table data structure.">
|
||||
<polygon fill="#999999" stroke="#666666" points="177,-85 67,-85 67,-55 177,-55 177,-85"/>
|
||||
<text text-anchor="start" x="75" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries/sparse</text>
|
||||
<text text-anchor="middle" x="122" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_table.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="189,-85 79,-85 79,-55 189,-55 189,-85"/>
|
||||
<text text-anchor="start" x="87" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries/sparse</text>
|
||||
<text text-anchor="middle" x="134" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_table.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,61 +22,61 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="44,-19 0,-19 0,0 44,0 44,-19"/>
|
||||
<text text-anchor="middle" x="22" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="56,-19 0,-19 0,0 56,0 56,-19"/>
|
||||
<text text-anchor="middle" x="28" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M97.28,-54.54C81.96,-45.58 62.34,-34.1 46.98,-25.11"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="48.83,-22.14 38.43,-20.11 45.29,-28.18 48.83,-22.14"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M107.8,-54.54C91.4,-45.49 70.36,-33.88 54.01,-24.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.8,-21.85 45.35,-20.08 52.42,-27.97 55.8,-21.85"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="111.5,-19 62.5,-19 62.5,0 111.5,0 111.5,-19"/>
|
||||
<text text-anchor="middle" x="87" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="123.5,-19 74.5,-19 74.5,0 123.5,0 123.5,-19"/>
|
||||
<text text-anchor="middle" x="99" y="-7" 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="#63b8ff" d="M113.35,-54.54C108.73,-46.82 103,-37.24 98.06,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="101.11,-27.26 92.97,-20.47 95.1,-30.85 101.11,-27.26"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M125.35,-54.54C120.73,-46.82 115,-37.24 110.06,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.11,-27.26 104.97,-20.47 107.1,-30.85 113.11,-27.26"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="184,-19 130,-19 130,0 184,0 184,-19"/>
|
||||
<text text-anchor="middle" x="157" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="196,-19 142,-19 142,0 196,0 196,-19"/>
|
||||
<text text-anchor="middle" x="169" y="-7" 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="#63b8ff" d="M130.65,-54.54C135.27,-46.82 141,-37.24 145.94,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.9,-30.85 151.03,-20.47 142.89,-27.26 148.9,-30.85"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M142.65,-54.54C147.27,-46.82 153,-37.24 157.94,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.9,-30.85 163.03,-20.47 154.89,-27.26 160.9,-30.85"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="258,-19 202,-19 202,0 258,0 258,-19"/>
|
||||
<text text-anchor="middle" x="230" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="258,-19 214,-19 214,0 258,0 258,-19"/>
|
||||
<text text-anchor="middle" x="236" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M148.7,-54.54C165.56,-45.4 187.24,-33.66 203.98,-24.6"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="205.21,-27.91 212.34,-20.07 201.88,-21.75 205.21,-27.91"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M159.21,-54.54C174.99,-45.49 195.23,-33.88 210.97,-24.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="212.33,-28.11 219.26,-20.1 208.85,-22.04 212.33,-28.11"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.4 KiB After Width: | Height: | Size: 3.4 KiB |
@@ -106,10 +106,10 @@ $(document).ready(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tr
|
||||
|
||||
<p>[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <climits></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for boruvkas_minimum_spanning_tree.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -120,7 +120,7 @@ Include dependency graph for boruvkas_minimum_spanning_tree.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:d2/d90/namespacegreedy__algorithms"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
|
||||
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft"> </td><td class="mdescRight">Greedy Algorithms. <br /></td></tr>
|
||||
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
|
||||
<tr class="memdesc:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation. <br /></td></tr>
|
||||
@@ -150,7 +150,8 @@ Functions</h2></td></tr>
|
||||
<p>Boruvka's algorithm is a greepy algorithm to find the MST by starting with small trees, and combining them to build bigger ones.</p><ol type="1">
|
||||
<li>Creates a group for every vertex.</li>
|
||||
<li>looks through each edge of every vertex for the smallest weight. Keeps track of the smallest edge for each of the current groups.</li>
|
||||
<li>Combine each group with the group it shares its smallest edge, adding the smallest edge to the MST.</li>
|
||||
</ol>
|
||||
<p>Combine each group with the group it shares its smallest edge, adding the smallest edge to the MST.</p><ol type="1">
|
||||
<li>Repeat step 2-3 until all vertices are combined into a single group.</li>
|
||||
</ol>
|
||||
<p>It assumes that the graph is connected. Non-connected edges can be represented using 0 or INT_MAX </p>
|
||||
@@ -179,112 +180,116 @@ Functions</h2></td></tr>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the MST as 2d vectors </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 57</span> {</div>
|
||||
<div class="line"><span class="lineno"> 58</span> </div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="keywordtype">size_t</span> size = adj.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">size_t</span> total_groups = size;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> </div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (size <= 1) {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> adj;</div>
|
||||
<div class="line"><span class="lineno"> 64</span> }</div>
|
||||
<div class="line"><span class="lineno"> 65</span> </div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="comment">// Stores the current Minimum Spanning Tree. As groups are combined, they are added to the MST</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> MST(size, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(size, INT_MAX));</div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 69</span> MST[i][i] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span> </div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="comment">// Step 1: Create a group for each vertex</span></div>
|
||||
<div class="line"><span class="lineno"> 73</span> </div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="comment">// Stores the parent of the vertex and its current depth, both initialized to 0</span></div>
|
||||
<div class="line"><span class="lineno"> 75</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::pair<int, int></a>> parent(size, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, 0)); </div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordtype">size_t</span> size = adj.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="keywordtype">size_t</span> total_groups = size;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> </div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">if</span> (size <= 1) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> adj;</div>
|
||||
<div class="line"><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><span class="lineno"> 67</span> </div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="comment">// Stores the current Minimum Spanning Tree. As groups are combined, they</span></div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="comment">// are added to the MST</span></div>
|
||||
<div class="line"><span class="lineno"> 70</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> MST(size, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>(size, INT_MAX));</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> MST[i][i] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 73</span> }</div>
|
||||
<div class="line"><span class="lineno"> 74</span> </div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="comment">// Step 1: Create a group for each vertex</span></div>
|
||||
<div class="line"><span class="lineno"> 76</span> </div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 78</span> parent[i].first = i; <span class="comment">// Sets parent of each vertex to itself, depth remains 0</span></div>
|
||||
<div class="line"><span class="lineno"> 79</span> }</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="comment">// Stores the parent of the vertex and its current depth, both initialized</span></div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="comment">// to 0</span></div>
|
||||
<div class="line"><span class="lineno"> 79</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::pair<int, int></a>> parent(size, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, 0));</div>
|
||||
<div class="line"><span class="lineno"> 80</span> </div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="comment">// Repeat until all are in a single group</span></div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">while</span> (total_groups > 1) {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> </div>
|
||||
<div class="line"><span class="lineno"> 84</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::pair<int,int></a>> smallest_edge(size, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(-1, -1)); <span class="comment">//Pairing: start node, end node</span></div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> parent[i].first =</div>
|
||||
<div class="line"><span class="lineno"> 83</span> i; <span class="comment">// Sets parent of each vertex to itself, depth remains 0</span></div>
|
||||
<div class="line"><span class="lineno"> 84</span> }</div>
|
||||
<div class="line"><span class="lineno"> 85</span> </div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="comment">// Step 2: Look throught each vertex for its smallest edge, only using the right half of the adj matrix</span></div>
|
||||
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i+1; j < size; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 89</span> </div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">if</span> (adj[i][j] == INT_MAX || adj[i][j] == 0) { <span class="comment">// No connection</span></div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> }</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="comment">// Finds the parents of the start and end points to make sure they arent in the same group</span></div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordtype">int</span> parentA = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, i);</div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">int</span> parentB = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, j);</div>
|
||||
<div class="line"><span class="lineno"> 97</span> </div>
|
||||
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">if</span> (parentA != parentB) {</div>
|
||||
<div class="line"><span class="lineno"> 99</span> </div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="comment">// Grabs the start and end points for the first groups current smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keywordtype">int</span> start = smallest_edge[parentA].first;</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[parentA].second;</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="comment">// Repeat until all are in a single group</span></div>
|
||||
<div class="line"><span class="lineno"> 87</span> <span class="keywordflow">while</span> (total_groups > 1) {</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::pair<int, int></a>> smallest_edge(</div>
|
||||
<div class="line"><span class="lineno"> 89</span> size, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(-1, -1)); <span class="comment">// Pairing: start node, end node</span></div>
|
||||
<div class="line"><span class="lineno"> 90</span> </div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="comment">// Step 2: Look throught each vertex for its smallest edge, only using</span></div>
|
||||
<div class="line"><span class="lineno"> 92</span> <span class="comment">// the right half of the adj matrix</span></div>
|
||||
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < size; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <span class="keywordflow">if</span> (adj[i][j] == INT_MAX || adj[i][j] == 0) { <span class="comment">// No connection</span></div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><span class="lineno"> 97</span> }</div>
|
||||
<div class="line"><span class="lineno"> 98</span> </div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="comment">// Finds the parents of the start and end points to make sure</span></div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="comment">// they arent in the same group</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keywordtype">int</span> parentA = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, i);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> <span class="keywordtype">int</span> parentB = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, j);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> </div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="comment">// If there is no current smallest edge, or the new edge is smaller, records the new smallest</span></div>
|
||||
<div class="line"><span class="lineno"> 105</span> <span class="keywordflow">if</span> (start == -1 || adj [i][j] < adj[start][end]) {</div>
|
||||
<div class="line"><span class="lineno"> 106</span> smallest_edge[parentA].first = i;</div>
|
||||
<div class="line"><span class="lineno"> 107</span> smallest_edge[parentA].second = j;</div>
|
||||
<div class="line"><span class="lineno"> 108</span> }</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (parentA != parentB) {</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <span class="comment">// Grabs the start and end points for the first groups</span></div>
|
||||
<div class="line"><span class="lineno"> 106</span> <span class="comment">// current smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 107</span> <span class="keywordtype">int</span> start = smallest_edge[parentA].first;</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[parentA].second;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> </div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="comment">// Does the same for the second group</span></div>
|
||||
<div class="line"><span class="lineno"> 111</span> start = smallest_edge[parentB].first;</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[parentB].second;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> </div>
|
||||
<div class="line"><span class="lineno"> 114</span> <span class="keywordflow">if</span> (start == -1 || adj[j][i] < adj[start][end]) {</div>
|
||||
<div class="line"><span class="lineno"> 115</span> smallest_edge[parentB].first = j;</div>
|
||||
<div class="line"><span class="lineno"> 116</span> smallest_edge[parentB].second = i;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> }</div>
|
||||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><span class="lineno"> 119</span> }</div>
|
||||
<div class="line"><span class="lineno"> 120</span> }</div>
|
||||
<div class="line"><span class="lineno"> 121</span> </div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="comment">// Step 3: Combine the groups based off their smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 123</span> </div>
|
||||
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 125</span> </div>
|
||||
<div class="line"><span class="lineno"> 126</span> <span class="comment">// Makes sure the smallest edge exists</span></div>
|
||||
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (smallest_edge[i].first != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="comment">// If there is no current smallest edge, or the new edge is</span></div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="comment">// smaller, records the new smallest</span></div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">if</span> (start == -1 || adj[i][j] < adj[start][end]) {</div>
|
||||
<div class="line"><span class="lineno"> 113</span> smallest_edge[parentA].first = i;</div>
|
||||
<div class="line"><span class="lineno"> 114</span> smallest_edge[parentA].second = j;</div>
|
||||
<div class="line"><span class="lineno"> 115</span> }</div>
|
||||
<div class="line"><span class="lineno"> 116</span> </div>
|
||||
<div class="line"><span class="lineno"> 117</span> <span class="comment">// Does the same for the second group</span></div>
|
||||
<div class="line"><span class="lineno"> 118</span> start = smallest_edge[parentB].first;</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[parentB].second;</div>
|
||||
<div class="line"><span class="lineno"> 120</span> </div>
|
||||
<div class="line"><span class="lineno"> 121</span> <span class="keywordflow">if</span> (start == -1 || adj[j][i] < adj[start][end]) {</div>
|
||||
<div class="line"><span class="lineno"> 122</span> smallest_edge[parentB].first = j;</div>
|
||||
<div class="line"><span class="lineno"> 123</span> smallest_edge[parentB].second = i;</div>
|
||||
<div class="line"><span class="lineno"> 124</span> }</div>
|
||||
<div class="line"><span class="lineno"> 125</span> }</div>
|
||||
<div class="line"><span class="lineno"> 126</span> }</div>
|
||||
<div class="line"><span class="lineno"> 127</span> }</div>
|
||||
<div class="line"><span class="lineno"> 128</span> </div>
|
||||
<div class="line"><span class="lineno"> 129</span> <span class="comment">// Start and end points for the groups smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 130</span> <span class="keywordtype">int</span> start = smallest_edge[i].first;</div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[i].second;</div>
|
||||
<div class="line"><span class="lineno"> 132</span> </div>
|
||||
<div class="line"><span class="lineno"> 133</span> <span class="comment">// Parents of the two groups - A is always itself</span></div>
|
||||
<div class="line"><span class="lineno"> 134</span> <span class="keywordtype">int</span> parentA = i;</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <span class="keywordtype">int</span> parentB = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, end);</div>
|
||||
<div class="line"><span class="lineno"> 136</span> </div>
|
||||
<div class="line"><span class="lineno"> 137</span> <span class="comment">// Makes sure the two nodes dont share the same parent. Would happen if the two groups have been </span></div>
|
||||
<div class="line"><span class="lineno"> 138</span> <span class="comment">//merged previously through a common shortest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">if</span> (parentA == parentB) {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><span class="lineno"> 141</span> }</div>
|
||||
<div class="line"><span class="lineno"> 142</span> </div>
|
||||
<div class="line"><span class="lineno"> 143</span> <span class="comment">// Tries to balance the trees as much as possible as they are merged. The parent of the shallower</span></div>
|
||||
<div class="line"><span class="lineno"> 144</span> <span class="comment">//tree will be pointed to the parent of the deeper tree.</span></div>
|
||||
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">if</span> (parent[parentA].second < parent[parentB].second) {</div>
|
||||
<div class="line"><span class="lineno"> 146</span> parent[parentB].first = parentA; <span class="comment">//New parent</span></div>
|
||||
<div class="line"><span class="lineno"> 147</span> parent[parentB].second++; <span class="comment">//Increase depth</span></div>
|
||||
<div class="line"><span class="lineno"> 148</span> }</div>
|
||||
<div class="line"><span class="lineno"> 149</span> <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 150</span> parent[parentA].first = parentB;</div>
|
||||
<div class="line"><span class="lineno"> 151</span> parent[parentA].second++;</div>
|
||||
<div class="line"><span class="lineno"> 152</span> }</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <span class="comment">// Add the connection to the MST, using both halves of the adj matrix</span></div>
|
||||
<div class="line"><span class="lineno"> 154</span> MST[start][<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>] = adj[start][<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>];</div>
|
||||
<div class="line"><span class="lineno"> 155</span> MST[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>][start] = adj[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>][start];</div>
|
||||
<div class="line"><span class="lineno"> 156</span> total_groups--; <span class="comment">// one fewer group</span></div>
|
||||
<div class="line"><span class="lineno"> 157</span> }</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="line"><span class="lineno"> 159</span> } </div>
|
||||
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> MST; </div>
|
||||
<div class="line"><span class="lineno"> 161</span>}</div>
|
||||
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a95de0f5e70e83164dbd1b4c515565e84"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector< std::pair< int, int > > parent, const int v)</div><div class="ttdoc">Recursively returns the vertex's parent at the root of the tree.</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:44</div></div>
|
||||
<div class="line"><span class="lineno"> 129</span> <span class="comment">// Step 3: Combine the groups based off their smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 130</span> </div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="comment">// Makes sure the smallest edge exists</span></div>
|
||||
<div class="line"><span class="lineno"> 133</span> <span class="keywordflow">if</span> (smallest_edge[i].first != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 134</span> <span class="comment">// Start and end points for the groups smallest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 135</span> <span class="keywordtype">int</span> start = smallest_edge[i].first;</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = smallest_edge[i].second;</div>
|
||||
<div class="line"><span class="lineno"> 137</span> </div>
|
||||
<div class="line"><span class="lineno"> 138</span> <span class="comment">// Parents of the two groups - A is always itself</span></div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="keywordtype">int</span> parentA = i;</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <span class="keywordtype">int</span> parentB = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, end);</div>
|
||||
<div class="line"><span class="lineno"> 141</span> </div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="comment">// Makes sure the two nodes dont share the same parent. Would</span></div>
|
||||
<div class="line"><span class="lineno"> 143</span> <span class="comment">// happen if the two groups have been</span></div>
|
||||
<div class="line"><span class="lineno"> 144</span> <span class="comment">// merged previously through a common shortest edge</span></div>
|
||||
<div class="line"><span class="lineno"> 145</span> <span class="keywordflow">if</span> (parentA == parentB) {</div>
|
||||
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">continue</span>;</div>
|
||||
<div class="line"><span class="lineno"> 147</span> }</div>
|
||||
<div class="line"><span class="lineno"> 148</span> </div>
|
||||
<div class="line"><span class="lineno"> 149</span> <span class="comment">// Tries to balance the trees as much as possible as they are</span></div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="comment">// merged. The parent of the shallower</span></div>
|
||||
<div class="line"><span class="lineno"> 151</span> <span class="comment">// tree will be pointed to the parent of the deeper tree.</span></div>
|
||||
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">if</span> (parent[parentA].second < parent[parentB].second) {</div>
|
||||
<div class="line"><span class="lineno"> 153</span> parent[parentB].first = parentA; <span class="comment">// New parent</span></div>
|
||||
<div class="line"><span class="lineno"> 154</span> parent[parentB].second++; <span class="comment">// Increase depth</span></div>
|
||||
<div class="line"><span class="lineno"> 155</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 156</span> parent[parentA].first = parentB;</div>
|
||||
<div class="line"><span class="lineno"> 157</span> parent[parentA].second++;</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="line"><span class="lineno"> 159</span> <span class="comment">// Add the connection to the MST, using both halves of the adj</span></div>
|
||||
<div class="line"><span class="lineno"> 160</span> <span class="comment">// matrix</span></div>
|
||||
<div class="line"><span class="lineno"> 161</span> MST[start][<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>] = adj[start][<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>];</div>
|
||||
<div class="line"><span class="lineno"> 162</span> MST[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>][start] = adj[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>][start];</div>
|
||||
<div class="line"><span class="lineno"> 163</span> total_groups--; <span class="comment">// one fewer group</span></div>
|
||||
<div class="line"><span class="lineno"> 164</span> }</div>
|
||||
<div class="line"><span class="lineno"> 165</span> }</div>
|
||||
<div class="line"><span class="lineno"> 166</span> }</div>
|
||||
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">return</span> MST;</div>
|
||||
<div class="line"><span class="lineno"> 168</span>}</div>
|
||||
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a95de0f5e70e83164dbd1b4c515565e84"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector< std::pair< int, int > > parent, const int v)</div><div class="ttdoc">Recursively returns the vertex's parent at the root of the tree.</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:47</div></div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</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>
|
||||
@@ -333,13 +338,13 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the parent of the vertex </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 44</span> {</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (parent[v].first != v) {</div>
|
||||
<div class="line"><span class="lineno"> 46</span> parent[v].first = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, parent[v].first);</div>
|
||||
<div class="line"><span class="lineno"> 47</span> }</div>
|
||||
<div class="line"><span class="lineno"> 48</span> </div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> parent[v].first;</div>
|
||||
<div class="line"><span class="lineno"> 50</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 47</span> {</div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">if</span> (parent[v].first != v) {</div>
|
||||
<div class="line"><span class="lineno"> 49</span> parent[v].first = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, parent[v].first);</div>
|
||||
<div class="line"><span class="lineno"> 50</span> }</div>
|
||||
<div class="line"><span class="lineno"> 51</span> </div>
|
||||
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">return</span> parent[v].first;</div>
|
||||
<div class="line"><span class="lineno"> 53</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -367,11 +372,11 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 219</span> {</div>
|
||||
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 221</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 222</span>}</div>
|
||||
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:190</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 224</span> {</div>
|
||||
<div class="line"><span class="lineno"> 225</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 226</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 227</span>}</div>
|
||||
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:196</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -405,21 +410,20 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>the int size of the tree </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 168</span> {</div>
|
||||
<div class="line"><span class="lineno"> 169</span> </div>
|
||||
<div class="line"><span class="lineno"> 170</span> <span class="keywordtype">size_t</span> size = adj.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 171</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
|
||||
<div class="line"><span class="lineno"> 172</span> </div>
|
||||
<div class="line"><span class="lineno"> 173</span> <span class="comment">//Moves through one side of the adj matrix, counting the sums of each edge</span></div>
|
||||
<div class="line"><span class="lineno"> 174</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 175</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < size; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 176</span> <span class="keywordflow">if</span> (adj[i][j] < INT_MAX) {</div>
|
||||
<div class="line"><span class="lineno"> 177</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += adj[i][j];</div>
|
||||
<div class="line"><span class="lineno"> 178</span> }</div>
|
||||
<div class="line"><span class="lineno"> 179</span> }</div>
|
||||
<div class="line"><span class="lineno"> 180</span> }</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>;</div>
|
||||
<div class="line"><span class="lineno"> 182</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 175</span> {</div>
|
||||
<div class="line"><span class="lineno"> 176</span> <span class="keywordtype">size_t</span> size = adj.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 177</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
|
||||
<div class="line"><span class="lineno"> 178</span> </div>
|
||||
<div class="line"><span class="lineno"> 179</span> <span class="comment">// Moves through one side of the adj matrix, counting the sums of each edge</span></div>
|
||||
<div class="line"><span class="lineno"> 180</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 181</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < size; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (adj[i][j] < INT_MAX) {</div>
|
||||
<div class="line"><span class="lineno"> 183</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += adj[i][j];</div>
|
||||
<div class="line"><span class="lineno"> 184</span> }</div>
|
||||
<div class="line"><span class="lineno"> 185</span> }</div>
|
||||
<div class="line"><span class="lineno"> 186</span> }</div>
|
||||
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>;</div>
|
||||
<div class="line"><span class="lineno"> 188</span>}</div>
|
||||
<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector< std::valarray< T > > &A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -455,32 +459,31 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 190</span> {</div>
|
||||
<div class="line"><span class="lineno"> 191</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Starting tests...\n\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 192</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
|
||||
<div class="line"><span class="lineno"> 193</span> {0, 5, INT_MAX, 3, INT_MAX} ,</div>
|
||||
<div class="line"><span class="lineno"> 194</span> {5, 0, 2, INT_MAX, 5} ,</div>
|
||||
<div class="line"><span class="lineno"> 195</span> {INT_MAX, 2, 0, INT_MAX, 3} ,</div>
|
||||
<div class="line"><span class="lineno"> 196</span> {3, INT_MAX, INT_MAX, 0, INT_MAX} ,</div>
|
||||
<div class="line"><span class="lineno"> 197</span> {INT_MAX, 5, 3, INT_MAX, 0} ,</div>
|
||||
<div class="line"><span class="lineno"> 198</span> };</div>
|
||||
<div class="line"><span class="lineno"> 199</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> MST = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
|
||||
<div class="line"><span class="lineno"> 200</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(MST) == 13);</div>
|
||||
<div class="line"><span class="lineno"> 201</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 202</span> </div>
|
||||
<div class="line"><span class="lineno"> 203</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
|
||||
<div class="line"><span class="lineno"> 204</span> { 0, 2, 0, 6, 0 },</div>
|
||||
<div class="line"><span class="lineno"> 205</span> { 2, 0, 3, 8, 5 },</div>
|
||||
<div class="line"><span class="lineno"> 206</span> { 0, 3, 0, 0, 7 },</div>
|
||||
<div class="line"><span class="lineno"> 207</span> { 6, 8, 0, 0, 9 },</div>
|
||||
<div class="line"><span class="lineno"> 208</span> { 0, 5, 7, 9, 0 }</div>
|
||||
<div class="line"><span class="lineno"> 209</span> };</div>
|
||||
<div class="line"><span class="lineno"> 210</span> MST = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
|
||||
<div class="line"><span class="lineno"> 211</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(MST) == 16);</div>
|
||||
<div class="line"><span class="lineno"> 212</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 213</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 196</span> {</div>
|
||||
<div class="line"><span class="lineno"> 197</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Starting tests...\n\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 198</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
|
||||
<div class="line"><span class="lineno"> 199</span> {0, 5, INT_MAX, 3, INT_MAX}, {5, 0, 2, INT_MAX, 5},</div>
|
||||
<div class="line"><span class="lineno"> 200</span> {INT_MAX, 2, 0, INT_MAX, 3}, {3, INT_MAX, INT_MAX, 0, INT_MAX},</div>
|
||||
<div class="line"><span class="lineno"> 201</span> {INT_MAX, 5, 3, INT_MAX, 0},</div>
|
||||
<div class="line"><span class="lineno"> 202</span> };</div>
|
||||
<div class="line"><span class="lineno"> 203</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> MST =</div>
|
||||
<div class="line"><span class="lineno"> 204</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
|
||||
<div class="line"><span class="lineno"> 205</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
|
||||
<div class="line"><span class="lineno"> 206</span> MST) == 13);</div>
|
||||
<div class="line"><span class="lineno"> 207</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 208</span> </div>
|
||||
<div class="line"><span class="lineno"> 209</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {{0, 2, 0, 6, 0},</div>
|
||||
<div class="line"><span class="lineno"> 210</span> {2, 0, 3, 8, 5},</div>
|
||||
<div class="line"><span class="lineno"> 211</span> {0, 3, 0, 0, 7},</div>
|
||||
<div class="line"><span class="lineno"> 212</span> {6, 8, 0, 0, 9},</div>
|
||||
<div class="line"><span class="lineno"> 213</span> {0, 5, 7, 9, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 214</span> MST = <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
|
||||
<div class="line"><span class="lineno"> 215</span> assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
|
||||
<div class="line"><span class="lineno"> 216</span> MST) == 16);</div>
|
||||
<div class="line"><span class="lineno"> 217</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test passed!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 218</span>}</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="aboruvkas__minimum__spanning__tree_8cpp_html_a94c615fc66b72e0adbcbcb99aabb1a59"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector< std::vector< int > > boruvkas(std::vector< std::vector< int > > adj)</div><div class="ttdoc">the implementation of boruvka's algorithm</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:57</div></div>
|
||||
<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a94c615fc66b72e0adbcbcb99aabb1a59"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector< std::vector< int > > boruvkas(std::vector< std::vector< int > > adj)</div><div class="ttdoc">the implementation of boruvka's algorithm</div><div class="ttdef"><b>Definition:</b> boruvkas_minimum_spanning_tree.cpp:60</div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
|
||||
@@ -109,8 +109,8 @@ $(document).ready(function(){initNavTree('d4/d8f/travelling__salesman__using__bi
|
||||
<div class="textblock"><code>#include <algorithm></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
<code>#include <limits></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for travelling_salesman_using_bit_manipulation.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -164,11 +164,11 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 116</span> {</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 119</span>}</div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> travelling_salesman_using_bit_manipulation.cpp:84</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
|
||||
<div class="line"><span class="lineno"> 139</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 140</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 141</span>}</div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> travelling_salesman_using_bit_manipulation.cpp:99</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -203,36 +203,44 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="comment">// 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dist = {</div>
|
||||
<div class="line"><span class="lineno"> 87</span> {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}</div>
|
||||
<div class="line"><span class="lineno"> 88</span> };</div>
|
||||
<div class="line"><span class="lineno"> 89</span> uint32_t V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 91</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) == 97);</div>
|
||||
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case: passed!"</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="comment">// 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 95</span> dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 96</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp1(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 98</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp1) == 75);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case: passed!"</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="comment">// 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> dist = {</div>
|
||||
<div class="line"><span class="lineno"> 102</span> {0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}</div>
|
||||
<div class="line"><span class="lineno"> 103</span> };</div>
|
||||
<div class="line"><span class="lineno"> 104</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp2(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 106</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp2) == 80);</div>
|
||||
<div class="line"><span class="lineno"> 107</span> </div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case: passed!"</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> </div>
|
||||
<div class="line"><span class="lineno"> 110</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 99</span> {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="comment">// 1st test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dist = {</div>
|
||||
<div class="line"><span class="lineno"> 102</span> {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 103</span> uint32_t V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 << V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 105</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) ==</div>
|
||||
<div class="line"><span class="lineno"> 107</span> 97);</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"1st test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 109</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 110</span> </div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="comment">// 2nd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 112</span> dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 113</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp1(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 116</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp1) ==</div>
|
||||
<div class="line"><span class="lineno"> 118</span> 75);</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"2nd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 120</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <span class="comment">// 3rd test-case</span></div>
|
||||
<div class="line"><span class="lineno"> 122</span> dist = {{0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
|
||||
<div class="line"><span class="lineno"> 123</span> V = dist.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<uint32_t></a>> dp2(1 << V,</div>
|
||||
<div class="line"><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint32_t></a>(V, -1));</div>
|
||||
<div class="line"><span class="lineno"> 126</span> assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp2) ==</div>
|
||||
<div class="line"><span class="lineno"> 128</span> 80);</div>
|
||||
<div class="line"><span class="lineno"> 129</span> </div>
|
||||
<div class="line"><span class="lineno"> 130</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"3rd test-case: passed!"</span></div>
|
||||
<div class="line"><span class="lineno"> 131</span> << <span class="stringliteral">"\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 132</span>}</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="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition:</b> partition_problem.cpp:39</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="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a></div><div class="ttdeci">std::uint64_t travelling_salesman_using_bit_manipulation(std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition:</b> travelling_salesman_using_bit_manipulation.cpp:52</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -299,31 +307,36 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>minimum cost of traversing whole nodes/cities from starting point back to starting point </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 55</span>{</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="comment">//base case;</span></div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (setOfCities == (1 << n) - 1) <span class="comment">// we have covered all the cities</span></div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> dist[city][0]; <span class="comment">//return the cost from the current city to the original city.</span></div>
|
||||
<div class="line"><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1)</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <span class="comment">//otherwise try all possible options</span></div>
|
||||
<div class="line"><span class="lineno"> 63</span> uint64_t ans = 2147483647 ;</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice < n; choice++) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="comment">//check if the city is visited or not.</span></div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> ((setOfCities & (1 << choice)) == 0 ) { <span class="comment">// this means that this perticular city is not visited.</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> subProb = dist[city][choice] + <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, setOfCities | (1 << choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="comment">// Here we are doing a recursive call to tsp with the updated set of city/node</span></div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="comment">// and choice which tells that where we are currently.</span></div>
|
||||
<div class="line"><span class="lineno"> 70</span> ans = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(ans, subProb);</div>
|
||||
<div class="line"><span class="lineno"> 71</span> }</div>
|
||||
<div class="line"><span class="lineno"> 72</span> </div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 64</span>{</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="comment">// base case;</span></div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (setOfCities == (1 << n) - 1) { <span class="comment">// we have covered all the cities</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> dist[city][0]; <span class="comment">// return the cost from the current city to the</span></div>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="comment">// original city.</span></div>
|
||||
<div class="line"><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><span class="lineno"> 70</span> </div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1) {</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
|
||||
<div class="line"><span class="lineno"> 73</span> }</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 76</span>}</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <span class="comment">// otherwise try all possible options</span></div>
|
||||
<div class="line"><span class="lineno"> 75</span> uint64_t ans = 2147483647;</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice < n; choice++) {</div>
|
||||
<div class="line"><span class="lineno"> 77</span> <span class="comment">// check if the city is visited or not.</span></div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">if</span> ((setOfCities & (1 << choice)) ==</div>
|
||||
<div class="line"><span class="lineno"> 79</span> 0) { <span class="comment">// this means that this perticular city is not visited.</span></div>
|
||||
<div class="line"><span class="lineno"> 80</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> subProb =</div>
|
||||
<div class="line"><span class="lineno"> 81</span> dist[city][choice] +</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
|
||||
<div class="line"><span class="lineno"> 83</span> dist, setOfCities | (1 << choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="comment">// Here we are doing a recursive call to tsp with the updated set of</span></div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> ans = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(ans, subProb);</div>
|
||||
<div class="line"><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><span class="lineno"> 88</span> }</div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 91</span>}</div>
|
||||
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></div></div>
|
||||
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
||||
<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a></div><div class="ttdeci">std::uint64_t travelling_salesman_using_bit_manipulation(std::vector< std::vector< uint32_t > > dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector< std::vector< uint32_t > > &dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition:</b> travelling_salesman_using_bit_manipulation.cpp:48</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
|
||||
@@ -106,10 +106,10 @@ $(document).ready(function(){initNavTree('d4/d96/range__queries_2sparse__table_8
|
||||
|
||||
<p>Implementation of <a href="https://en.wikipedia.org/wiki/Range_minimum_query" target="_blank">Sparse Table</a> data structure.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <vector></code><br />
|
||||
<div class="textblock"><code>#include <algorithm></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <algorithm></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for sparse_table.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -188,23 +188,23 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>created sparse table data structure </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 54</span> {</div>
|
||||
<div class="line"><span class="lineno"> 55</span> <span class="keywordtype">int</span> n = A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<T></a> > table(20, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a>(n+5, 0));</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">int</span> curLen = 0;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0 ; i <= logs[n] ; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 59</span> curLen = 1 << i;</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0 ; j + curLen < n ; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">if</span> (curLen == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> table[i][j] = A[j];</div>
|
||||
<div class="line"><span class="lineno"> 63</span> }</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> table[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(table[i-1][j], table[i-1][j + curLen/2]);</div>
|
||||
<div class="line"><span class="lineno"> 66</span> }</div>
|
||||
<div class="line"><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">return</span> table;</div>
|
||||
<div class="line"><span class="lineno"> 70</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 57</span> {</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <span class="keywordtype">int</span> n = A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<T></a> > table(20, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a>(n + 5, 0));</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">int</span> curLen = 0;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i <= logs[n]; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> curLen = 1 << i;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j + curLen < n; j++) {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">if</span> (curLen == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> table[i][j] = A[j];</div>
|
||||
<div class="line"><span class="lineno"> 66</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 67</span> table[i][j] =</div>
|
||||
<div class="line"><span class="lineno"> 68</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(table[i - 1][j], table[i - 1][j + curLen / 2]);</div>
|
||||
<div class="line"><span class="lineno"> 69</span> }</div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span> }</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> table;</div>
|
||||
<div class="line"><span class="lineno"> 73</span>}</div>
|
||||
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
|
||||
<div class="ttc" id="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
@@ -241,15 +241,15 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>corresponding vector of the log table </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 36</span> {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordtype">int</span> n = A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 38</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a> logs(n);</div>
|
||||
<div class="line"><span class="lineno"> 39</span> logs[1] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2 ; i < n ; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 41</span> logs[i] = logs[i/2] + 1;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> }</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">return</span> logs;</div>
|
||||
<div class="line"><span class="lineno"> 44</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> n = A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a> logs(n);</div>
|
||||
<div class="line"><span class="lineno"> 41</span> logs[1] = 0;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i < n; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 43</span> logs[i] = logs[i / 2] + 1;</div>
|
||||
<div class="line"><span class="lineno"> 44</span> }</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">return</span> logs;</div>
|
||||
<div class="line"><span class="lineno"> 46</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -308,11 +308,11 @@ template<typename T > </div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>minimum value for the [beg, end] range for the input array </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> <span class="keywordtype">int</span> p = logs[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - beg + 1];</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordtype">int</span> pLen = 1 << p;</div>
|
||||
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(table[p][beg], table[p][end - pLen + 1]);</div>
|
||||
<div class="line"><span class="lineno"> 85</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 85</span> {</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="keywordtype">int</span> p = logs[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - beg + 1];</div>
|
||||
<div class="line"><span class="lineno"> 87</span> <span class="keywordtype">int</span> pLen = 1 << p;</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(table[p][beg], table[p][end - pLen + 1]);</div>
|
||||
<div class="line"><span class="lineno"> 89</span>}</div>
|
||||
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -339,17 +339,18 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Main function </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 92</span> {</div>
|
||||
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> A{1, 2, 0, 3, 9};</div>
|
||||
<div class="line"><span class="lineno"> 94</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> logs = <a class="code hl_function" href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300">range_queries::sparse_table::computeLogs</a>(A);</div>
|
||||
<div class="line"><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a> > table = <a class="code hl_function" href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc">range_queries::sparse_table::buildTable</a>(A, logs);</div>
|
||||
<div class="line"><span class="lineno"> 96</span> assert(range_queries::sparse_table::getMinimum(0, 0, logs, table) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 97</span> assert(range_queries::sparse_table::getMinimum(0, 4, logs, table) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 98</span> assert(range_queries::sparse_table::getMinimum(2, 4, logs, table) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 100</span>}</div>
|
||||
<div class="ttc" id="arange__queries_2sparse__table_8cpp_html_a40810d8c0fe3f8cf432ab128b1ae0300"><div class="ttname"><a href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300">range_queries::sparse_table::computeLogs</a></div><div class="ttdeci">std::vector< T > computeLogs(const std::vector< T > &A)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:36</div></div>
|
||||
<div class="ttc" id="arange__queries_2sparse__table_8cpp_html_a803a2451e87021d14ae06f148383e6bc"><div class="ttname"><a href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc">range_queries::sparse_table::buildTable</a></div><div class="ttdeci">std::vector< std::vector< T > > buildTable(const std::vector< T > &A, const std::vector< T > &logs)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:54</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 96</span> {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> A{1, 2, 0, 3, 9};</div>
|
||||
<div class="line"><span class="lineno"> 98</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> logs = <a class="code hl_function" href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300">range_queries::sparse_table::computeLogs</a>(A);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a> > table =</div>
|
||||
<div class="line"><span class="lineno"> 100</span> <a class="code hl_function" href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc">range_queries::sparse_table::buildTable</a>(A, logs);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> assert(range_queries::sparse_table::getMinimum(0, 0, logs, table) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 102</span> assert(range_queries::sparse_table::getMinimum(0, 4, logs, table) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> assert(range_queries::sparse_table::getMinimum(2, 4, logs, table) == 0);</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 105</span>}</div>
|
||||
<div class="ttc" id="arange__queries_2sparse__table_8cpp_html_a40810d8c0fe3f8cf432ab128b1ae0300"><div class="ttname"><a href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a40810d8c0fe3f8cf432ab128b1ae0300">range_queries::sparse_table::computeLogs</a></div><div class="ttdeci">std::vector< T > computeLogs(const std::vector< T > &A)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:38</div></div>
|
||||
<div class="ttc" id="arange__queries_2sparse__table_8cpp_html_a803a2451e87021d14ae06f148383e6bc"><div class="ttname"><a href="../../d4/d96/range__queries_2sparse__table_8cpp.html#a803a2451e87021d14ae06f148383e6bc">range_queries::sparse_table::buildTable</a></div><div class="ttdeci">std::vector< std::vector< T > > buildTable(const std::vector< T > &A, const std::vector< T > &logs)</div><div class="ttdef"><b>Definition:</b> sparse_table.cpp:56</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -195,6 +195,7 @@ Data Structures</h1>
|
||||
Divide And Conquer</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp" target="_blank">Karatsuba Algorithm For Fast Multiplication</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/divide_and_conquer/strassen_matrix_multiplication.cpp" target="_blank">Strassen Matrix Multiplication</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md50"></a>
|
||||
Dynamic Programming</h1>
|
||||
@@ -225,6 +226,7 @@ Dynamic Programming</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/partition_problem.cpp" target="_blank">Partition Problem</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/searching_of_element_in_dynamic_array.cpp" target="_blank">Searching Of Element In Dynamic Array</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/shortest_common_supersequence.cpp" target="_blank">Shortest Common Supersequence</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/subset_sum.cpp" target="_blank">Subset Sum</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/tree_height.cpp" target="_blank">Tree Height</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/dynamic_programming/word_break.cpp" target="_blank">Word Break</a></li>
|
||||
</ul>
|
||||
@@ -269,6 +271,7 @@ Graphics</h1>
|
||||
<h1><a class="anchor" id="autotoc_md54"></a>
|
||||
Greedy Algorithms</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/boruvkas_minimum_spanning_tree.cpp" target="_blank">Boruvkas Minimum Spanning Tree</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/dijkstra.cpp" target="_blank">Dijkstra</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/huffman.cpp" target="_blank">Huffman</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/greedy_algorithms/jumpgame.cpp" target="_blank">Jumpgame</a></li>
|
||||
@@ -300,6 +303,7 @@ Machine Learning</h1>
|
||||
<h1><a class="anchor" id="autotoc_md57"></a>
|
||||
Math</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/aliquot_sum.cpp" target="_blank">Aliquot Sum</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/approximate_pi.cpp" target="_blank">Approximate Pi</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/area.cpp" target="_blank">Area</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/HEAD/math/armstrong_number.cpp" target="_blank">Armstrong Number</a></li>
|
||||
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix< T, typename >" name="divide_and_conquer::strassens_multiplication::Matrix< T, typename >">
|
||||
<area shape="rect" id="node1" title="Matrix class." alt="" coords="5,108,176,163"/>
|
||||
<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="11,5,170,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
a22625568818402994c79e2294107cf7
|
||||
@@ -0,0 +1,40 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix< T, typename > Pages: 1 -->
|
||||
<svg width="136pt" height="126pt"
|
||||
viewBox="0.00 0.00 136.00 126.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 122)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix< T, typename ></title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Matrix class.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix< T, typename ></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="#666666" points="123.5,-118 4.5,-118 4.5,-88 123.5,-88 123.5,-118"/>
|
||||
<text text-anchor="start" x="12.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::vector</text>
|
||||
<text text-anchor="middle" x="64" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">< T > ></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="M64,-76.2C64,-64.86 64,-51.75 64,-41.21"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="60.5,-76.09 64,-86.09 67.5,-76.09 60.5,-76.09"/>
|
||||
<text text-anchor="middle" x="76.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00"> _mat</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.1 KiB |
@@ -108,12 +108,12 @@ $(document).ready(function(){initNavTree('d6/d80/dynamic__programming_2subset__s
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
<code>#include <unordered_map></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for subset_sum.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d53/dynamic__programming_2subset__sum_8cpp__incl.svg" width="391" height="124"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d53/dynamic__programming_2subset__sum_8cpp__incl.svg" width="392" height="124"><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">
|
||||
@@ -161,10 +161,10 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 122</span> {</div>
|
||||
<div class="line"><span class="lineno"> 123</span> <a class="code hl_function" href="../../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
|
||||
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 125</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 120</span> {</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_function" href="../../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 123</span>}</div>
|
||||
<div class="ttc" id="abacktracking_2subset__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/dfe/backtracking_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> subset_sum.cpp:57</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -208,11 +208,11 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true/false based on if the target sum subset exists or not. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 72</span> {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordtype">size_t</span> n = arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::unordered_map<int, bool></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
|
||||
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, &<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 76</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">size_t</span> n = arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::unordered_map<int, bool></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, &<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 74</span>}</div>
|
||||
<div class="ttc" id="adynamic__programming_2subset__sum_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)</div><div class="ttdef"><b>Definition:</b> subset_sum.cpp:43</div></div>
|
||||
<div class="ttc" id="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition:</b> partition_problem.cpp:39</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>
|
||||
@@ -272,24 +272,24 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true/false based on if the target sum subset exists or not. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 47</span> {</div>
|
||||
<div class="line"><span class="lineno"> 48</span> </div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span>(targetSum == 0) { <span class="comment">// Found a valid subset with required sum.</span></div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (targetSum == 0) { <span class="comment">// Found a valid subset with required sum.</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 48</span> }</div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (index == arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) { <span class="comment">// End of array</span></div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||||
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">if</span>(index == arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) { <span class="comment">// End of array</span></div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 54</span> }</div>
|
||||
<div class="line"><span class="lineno"> 55</span> </div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">if</span> ((*<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)[index].count(targetSum)) { <span class="comment">// Answer already present in map</span></div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">return</span> (*<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)[index][targetSum];</div>
|
||||
<div class="line"><span class="lineno"> 58</span> }</div>
|
||||
<div class="line"><span class="lineno"> 59</span> </div>
|
||||
<div class="line"><span class="lineno"> 60</span> <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum - arr[index], <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>, index + 1) </div>
|
||||
<div class="line"><span class="lineno"> 61</span> || <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>, index + 1);</div>
|
||||
<div class="line"><span class="lineno"> 62</span> (*dp)[index][targetSum] = ans; <span class="comment">// Save ans in dp map.</span></div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 64</span>}</div>
|
||||
<div class="line"><span class="lineno"> 52</span> </div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">if</span> ((*<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)[index].count(targetSum)) { <span class="comment">// Answer already present in map</span></div>
|
||||
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">return</span> (*<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)[index][targetSum];</div>
|
||||
<div class="line"><span class="lineno"> 55</span> }</div>
|
||||
<div class="line"><span class="lineno"> 56</span> </div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">bool</span> ans =</div>
|
||||
<div class="line"><span class="lineno"> 58</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum - arr[index], <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>, index + 1) ||</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>, index + 1);</div>
|
||||
<div class="line"><span class="lineno"> 60</span> (*dp)[index][targetSum] = ans; <span class="comment">// Save ans in dp map.</span></div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 62</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -324,41 +324,41 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Test Function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="comment">// custom input vector</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> custom_input_arr(3);</div>
|
||||
<div class="line"><span class="lineno"> 87</span> custom_input_arr[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> {1, -10, 2, 31, -6};</div>
|
||||
<div class="line"><span class="lineno"> 88</span> custom_input_arr[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> {2, 3, 4};</div>
|
||||
<div class="line"><span class="lineno"> 89</span> custom_input_arr[2] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> {0, 1, 0, 1, 0};</div>
|
||||
<div class="line"><span class="lineno"> 90</span> </div>
|
||||
<div class="line"><span class="lineno"> 91</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> custom_input_target_sum(3);</div>
|
||||
<div class="line"><span class="lineno"> 92</span> custom_input_target_sum[0] = -14;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> custom_input_target_sum[1] = 10;</div>
|
||||
<div class="line"><span class="lineno"> 94</span> custom_input_target_sum[2] = 2;</div>
|
||||
<div class="line"><span class="lineno"> 95</span> </div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="comment">// calculated output vector by pal_part Function</span></div>
|
||||
<div class="line"><span class="lineno"> 97</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> calculated_output(3);</div>
|
||||
<div class="line"><span class="lineno"> 98</span> </div>
|
||||
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 100</span> calculated_output[i] =</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a>(</div>
|
||||
<div class="line"><span class="lineno"> 102</span> custom_input_arr[i], custom_input_target_sum[i]);</div>
|
||||
<div class="line"><span class="lineno"> 103</span> }</div>
|
||||
<div class="line"><span class="lineno"> 104</span> </div>
|
||||
<div class="line"><span class="lineno"> 105</span> <span class="comment">// expected output vector</span></div>
|
||||
<div class="line"><span class="lineno"> 106</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> expected_output{<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>};</div>
|
||||
<div class="line"><span class="lineno"> 107</span> </div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="comment">// Testing implementation via assert function</span></div>
|
||||
<div class="line"><span class="lineno"> 109</span> <span class="comment">// It will throw error if any of the expected test fails</span></div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="comment">// Else it will give nothing</span></div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 112</span> assert(expected_output[i] == calculated_output[i]);</div>
|
||||
<div class="line"><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><span class="lineno"> 114</span> </div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests passed successfully!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 116</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 82</span> {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="comment">// custom input vector</span></div>
|
||||
<div class="line"><span class="lineno"> 84</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> custom_input_arr(3);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> custom_input_arr[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{1, -10, 2, 31, -6};</div>
|
||||
<div class="line"><span class="lineno"> 86</span> custom_input_arr[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{2, 3, 4};</div>
|
||||
<div class="line"><span class="lineno"> 87</span> custom_input_arr[2] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{0, 1, 0, 1, 0};</div>
|
||||
<div class="line"><span class="lineno"> 88</span> </div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> custom_input_target_sum(3);</div>
|
||||
<div class="line"><span class="lineno"> 90</span> custom_input_target_sum[0] = -14;</div>
|
||||
<div class="line"><span class="lineno"> 91</span> custom_input_target_sum[1] = 10;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> custom_input_target_sum[2] = 2;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="comment">// calculated output vector by pal_part Function</span></div>
|
||||
<div class="line"><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> calculated_output(3);</div>
|
||||
<div class="line"><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 98</span> calculated_output[i] =</div>
|
||||
<div class="line"><span class="lineno"> 99</span> <a class="code hl_function" href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a>(</div>
|
||||
<div class="line"><span class="lineno"> 100</span> custom_input_arr[i], custom_input_target_sum[i]);</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><span class="lineno"> 102</span> </div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="comment">// expected output vector</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> expected_output{<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>};</div>
|
||||
<div class="line"><span class="lineno"> 105</span> </div>
|
||||
<div class="line"><span class="lineno"> 106</span> <span class="comment">// Testing implementation via assert function</span></div>
|
||||
<div class="line"><span class="lineno"> 107</span> <span class="comment">// It will throw error if any of the expected test fails</span></div>
|
||||
<div class="line"><span class="lineno"> 108</span> <span class="comment">// Else it will give nothing</span></div>
|
||||
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 110</span> assert(expected_output[i] == calculated_output[i]);</div>
|
||||
<div class="line"><span class="lineno"> 111</span> }</div>
|
||||
<div class="line"><span class="lineno"> 112</span> </div>
|
||||
<div class="line"><span class="lineno"> 113</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests passed successfully!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 114</span>}</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="adynamic__programming_2subset__sum_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)</div><div class="ttdef"><b>Definition:</b> subset_sum.cpp:72</div></div>
|
||||
<div class="ttc" id="adynamic__programming_2subset__sum_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="../../d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)</div><div class="ttdef"><b>Definition:</b> subset_sum.cpp:70</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -105,7 +105,7 @@ $(document).ready(function(){initNavTree('d7/d81/namespacebit__manipulation.html
|
||||
<a href="../../d7/d81/namespacebit__manipulation.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>for IO operations </p>
|
||||
<p>for limits of integral types</p>
|
||||
<p>Bit manipulation algorithms.</p>
|
||||
<p>for io operations</p>
|
||||
<p>storing the numbers</p>
|
||||
<p>for assert</p>
|
||||
@@ -114,9 +114,7 @@ $(document).ready(function(){initNavTree('d7/d81/namespacebit__manipulation.html
|
||||
<p>Bit manipulation algorithms</p>
|
||||
<p>for assert</p>
|
||||
<p>Bit Manipulation algorithms</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br />
|
||||
</p>
|
||||
<p>Bit manipulation algorithms </p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for assert for IO operations for limits of integral types for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,20 @@
|
||||
var classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix =
|
||||
[
|
||||
[ "Matrix", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256", null ],
|
||||
[ "Matrix", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9", null ],
|
||||
[ "h_stack", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f", null ],
|
||||
[ "naive_multiplication", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50", null ],
|
||||
[ "operator*", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c", null ],
|
||||
[ "operator*", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e", null ],
|
||||
[ "operator*=", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12", null ],
|
||||
[ "operator+", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211", null ],
|
||||
[ "operator+=", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391", null ],
|
||||
[ "operator-", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e", null ],
|
||||
[ "operator-=", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d", null ],
|
||||
[ "operator==", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c", null ],
|
||||
[ "operator[]", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37", null ],
|
||||
[ "size", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1", null ],
|
||||
[ "slice", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17", null ],
|
||||
[ "strassens_multiplication", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a", null ],
|
||||
[ "v_stack", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe", null ]
|
||||
];
|
||||
@@ -0,0 +1,6 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::Matrix" name="divide_and_conquer::strassens_multiplication::Matrix::Matrix">
|
||||
<area shape="rect" id="node1" title="Constructor." alt="" coords="5,23,176,77"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/emplace_back.html#" title=" " alt="" coords="224,5,400,31"/>
|
||||
<area shape="rect" id="node3" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="227,55,397,109"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="448,69,564,95"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
eecf66b0edb8f9e27fb1ff9a4b8b955f
|
||||
@@ -0,0 +1,70 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
|
||||
<svg width="427pt" height="86pt"
|
||||
viewBox="0.00 0.00 427.00 86.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 82)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Constructor.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-65 0,-65 0,-24 128,-24 128,-65"/>
|
||||
<text text-anchor="start" x="8" y="-53" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</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/emplace_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="296,-78 164,-78 164,-59 296,-59 296,-78"/>
|
||||
<text text-anchor="middle" x="230" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.41,-53.78C136.25,-54.93 144.33,-56.11 152.34,-57.28"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.69,-60.72 162.1,-58.71 152.71,-53.8 151.69,-60.72"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="294,-41 166,-41 166,0 294,0 294,-41"/>
|
||||
<text text-anchor="start" x="174" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="174" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="230" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.41,-35.22C136.93,-33.97 145.74,-32.68 154.43,-31.41"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.88,-34.88 164.26,-29.97 153.86,-27.96 154.88,-34.88"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="419,-30 332,-30 332,-11 419,-11 419,-30"/>
|
||||
<text text-anchor="middle" x="375.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M294.36,-20.5C303.03,-20.5 311.87,-20.5 320.36,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="320.15,-24 330.15,-20.5 320.15,-17 320.15,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.6 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::slice" name="divide_and_conquer::strassens_multiplication::Matrix::slice">
|
||||
<area shape="rect" id="node1" title="Creates a new matrix and returns a part of it." alt="" coords="5,5,176,60"/>
|
||||
<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="224,20,340,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
fa5e3edf31d2e459d861367e7c8c629b
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::slice Pages: 1 -->
|
||||
<svg width="259pt" height="49pt"
|
||||
viewBox="0.00 0.00 259.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::slice</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Creates a new matrix and returns a part of it.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</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="#666666" points="251,-30 164,-30 164,-11 251,-11 251,-30"/>
|
||||
<text text-anchor="middle" x="207.5" y="-18" 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="#63b8ff" d="M128.3,-20.5C136.31,-20.5 144.45,-20.5 152.3,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.03,-24 162.03,-20.5 152.03,-17 152.03,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator-=" name="divide_and_conquer::strassens_multiplication::Matrix::operator-=">
|
||||
<area shape="rect" id="node1" title="Subtract another matrices to current matrix." alt="" coords="5,39,176,93"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="224,5,395,60"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="443,53,559,79"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
3411bd6ebbde73a24a0ca2a3a9859ec8
|
||||
@@ -0,0 +1,61 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator-= Pages: 1 -->
|
||||
<svg width="423pt" height="74pt"
|
||||
viewBox="0.00 0.00 423.00 74.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 70)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator-=</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Subtract another matrices to current matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator-=</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="292,-66 164,-66 164,-25 292,-25 292,-66"/>
|
||||
<text text-anchor="start" x="172" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="172" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="228" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.1,-30.24C136.01,-31.46 144.16,-32.72 152.23,-33.96"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.63,-37.41 162.05,-35.48 152.7,-30.49 151.63,-37.41"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415,-30 328,-30 328,-11 415,-11 415,-30"/>
|
||||
<text text-anchor="middle" x="371.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.36,-17.56C140.2,-17.12 152.48,-16.73 164,-16.5 220.88,-15.35 235.13,-15.05 292,-16.5 299.88,-16.7 308.2,-17.01 316.37,-17.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.07,-20.87 326.22,-17.85 316.4,-13.88 316.07,-20.87"/>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M292.3,-34.32C300.31,-32.9 308.45,-31.46 316.3,-30.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.82,-33.54 326.05,-28.35 315.6,-26.65 316.82,-33.54"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.3 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::Matrix" name="divide_and_conquer::strassens_multiplication::Matrix::Matrix">
|
||||
<area shape="rect" id="node1" title="Constructor." alt="" coords="5,5,176,60"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/emplace_back.html#" title=" " alt="" coords="224,20,400,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
0b1123d908f245bf515e57ae89b36d58
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
|
||||
<svg width="304pt" height="49pt"
|
||||
viewBox="0.00 0.00 304.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Constructor.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</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/emplace_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="296,-30 164,-30 164,-11 296,-11 296,-30"/>
|
||||
<text text-anchor="middle" x="230" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.41,-20.5C136.25,-20.5 144.33,-20.5 152.34,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.08,-24 162.08,-20.5 152.08,-17 152.08,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator==" name="divide_and_conquer::strassens_multiplication::Matrix::operator==">
|
||||
<area shape="rect" id="node1" title="Compares two matrices if each of them are equal or not." alt="" coords="5,5,176,60"/>
|
||||
<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="224,20,340,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
86034070b6f7046f1cce38cd932f2e45
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator== Pages: 1 -->
|
||||
<svg width="259pt" height="49pt"
|
||||
viewBox="0.00 0.00 259.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator==</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Compares two matrices if each of them are equal or not.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator==</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="#666666" points="251,-30 164,-30 164,-11 251,-11 251,-30"/>
|
||||
<text text-anchor="middle" x="207.5" y="-18" 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="#63b8ff" d="M128.3,-20.5C136.31,-20.5 144.45,-20.5 152.3,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.03,-24 162.03,-20.5 152.03,-17 152.03,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication" name="divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication">
|
||||
<area shape="rect" id="node1" title="Naive multiplication performed on this." alt="" coords="5,5,193,60"/>
|
||||
<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,20,357,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
1770187b3ea00acc0e0ca36ba278982b
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication Pages: 1 -->
|
||||
<svg width="272pt" height="49pt"
|
||||
viewBox="0.00 0.00 272.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Naive multiplication performed on this.">
|
||||
<polygon fill="#999999" stroke="#666666" points="141,-41 0,-41 0,0 141,0 141,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="70.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</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="#666666" points="264,-30 177,-30 177,-11 264,-11 264,-30"/>
|
||||
<text text-anchor="middle" x="220.5" y="-18" 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="#63b8ff" d="M141.17,-20.5C149.33,-20.5 157.56,-20.5 165.46,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.24,-24 175.24,-20.5 165.24,-17 165.24,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,6 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*" name="divide_and_conquer::strassens_multiplication::Matrix::operator*">
|
||||
<area shape="rect" id="node1" title="Multiply two matrices and returns a new matrix." alt="" coords="5,71,176,125"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" title="Naive multiplication performed on this." alt="" coords="224,5,412,60"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="460,85,576,111"/>
|
||||
<area shape="rect" id="node4" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="233,136,403,191"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
ace5e6003a1077c7bb1ccbef99119f60
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
|
||||
<svg width="436pt" height="147pt"
|
||||
viewBox="0.00 0.00 436.00 147.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 143)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Multiply two matrices and returns a new matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-90 0,-90 0,-49 128,-49 128,-90"/>
|
||||
<text text-anchor="start" x="8" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-67" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" target="_top" xlink:title="Naive multiplication performed on this.">
|
||||
<polygon fill="white" stroke="#666666" points="305,-139 164,-139 164,-98 305,-98 305,-139"/>
|
||||
<text text-anchor="start" x="172" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="172" y="-116" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="234.5" y="-105" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.22,-87.89C136.27,-90.23 144.6,-92.65 152.88,-95.05"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.67,-98.35 162.25,-97.78 153.63,-91.63 151.67,-98.35"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="428,-79 341,-79 341,-60 428,-60 428,-79"/>
|
||||
<text text-anchor="middle" x="384.5" y="-67" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.31,-69.5C187.08,-69.5 273.64,-69.5 329.3,-69.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.17,-73 339.17,-69.5 329.17,-66 329.17,-73"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="298.5,-41 170.5,-41 170.5,0 298.5,0 298.5,-41"/>
|
||||
<text text-anchor="start" x="178.5" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="178.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="234.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.22,-51.11C138.41,-48.15 149.04,-45.06 159.45,-42.03"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.13,-45.48 168.75,-39.33 158.17,-38.76 160.13,-45.48"/>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M298.69,-97.58C313.55,-92.66 329,-87.55 342.57,-83.05"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="343.65,-86.38 352.05,-79.91 341.45,-79.73 343.65,-86.38"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M298.69,-41.42C313.55,-46.34 329,-51.45 342.57,-55.95"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="341.45,-59.27 352.05,-59.09 343.65,-52.62 341.45,-59.27"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.6 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator-" name="divide_and_conquer::strassens_multiplication::Matrix::operator-">
|
||||
<area shape="rect" id="node1" title="Subtract two matrices and returns a new matrix." alt="" coords="5,39,176,93"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="224,5,395,60"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="443,53,559,79"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
2a3a80666e06d3eadd1ec53f71303ee2
|
||||
@@ -0,0 +1,61 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator- Pages: 1 -->
|
||||
<svg width="423pt" height="74pt"
|
||||
viewBox="0.00 0.00 423.00 74.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 70)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator-</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Subtract two matrices and returns a new matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator-</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="292,-66 164,-66 164,-25 292,-25 292,-66"/>
|
||||
<text text-anchor="start" x="172" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="172" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="228" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.1,-30.24C136.01,-31.46 144.16,-32.72 152.23,-33.96"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.63,-37.41 162.05,-35.48 152.7,-30.49 151.63,-37.41"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415,-30 328,-30 328,-11 415,-11 415,-30"/>
|
||||
<text text-anchor="middle" x="371.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.36,-17.56C140.2,-17.12 152.48,-16.73 164,-16.5 220.88,-15.35 235.13,-15.05 292,-16.5 299.88,-16.7 308.2,-17.01 316.37,-17.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.07,-20.87 326.22,-17.85 316.4,-13.88 316.07,-20.87"/>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M292.3,-34.32C300.31,-32.9 308.45,-31.46 316.3,-30.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.82,-33.54 326.05,-28.35 315.6,-26.65 316.82,-33.54"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.3 KiB |
@@ -0,0 +1,12 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication" name="divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication">
|
||||
<area shape="rect" id="node1" title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor..." alt="" coords="5,187,220,242"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f" title="Horizontally stack the matrix (one after the other)" alt="" coords="277,17,447,71"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="728,187,844,213"/>
|
||||
<area shape="rect" id="node5" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" title="Naive multiplication performed on this." alt="" coords="268,147,456,202"/>
|
||||
<area shape="rect" id="node6" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="507,263,677,318"/>
|
||||
<area shape="rect" id="node7" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17" title="Creates a new matrix and returns a part of it." alt="" coords="277,226,447,281"/>
|
||||
<area shape="rect" id="node8" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe" title="Horizontally stack the matrix (current matrix above the other)" alt="" coords="277,357,447,411"/>
|
||||
<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="515,46,669,71"/>
|
||||
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="532,394,652,419"/>
|
||||
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/emplace_back.html#" title=" " alt="" coords="504,443,680,469"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
e27c0534a15818b9a0298d8518dffd31
|
||||
@@ -0,0 +1,298 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication Pages: 1 -->
|
||||
<!--zoomable 356 -->
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="text/javascript"><![CDATA[
|
||||
var edges = document.getElementsByTagName('g');
|
||||
if (edges && edges.length) {
|
||||
for (var i=0;i<edges.length;i++) {
|
||||
if (edges[i].id.substr(0,4)=='edge') {
|
||||
edges[i].setAttribute('class','edge');
|
||||
}
|
||||
}
|
||||
}
|
||||
]]></script>
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="dirArrow">
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
|
||||
</use>
|
||||
</g>
|
||||
</defs>
|
||||
|
||||
<script type="text/javascript">
|
||||
var viewWidth = 637;
|
||||
var viewHeight = 356;
|
||||
var sectionId = 'dynsection-15';
|
||||
</script>
|
||||
<script xlink:href="../../svgpan.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...">
|
||||
<polygon fill="#999999" stroke="#666666" points="161,-211 0,-211 0,-170 161,-170 161,-211"/>
|
||||
<text text-anchor="start" x="8" y="-199" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="80.5" y="-177" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::strassens_multiplication</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M45.99,-211.49C42.7,-220.88 54.2,-229 80.5,-229 95.7,-229 105.96,-226.29 111.28,-222.18"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="114.52,-223.51 114.52,-212.92 107.91,-221.2 114.52,-223.51"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f" target="_top" xlink:title="Horizontally stack the matrix (one after the other)">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-339 203.5,-339 203.5,-298 331.5,-298 331.5,-339"/>
|
||||
<text text-anchor="start" x="211.5" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-316" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-305" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M104.28,-211.27C126.82,-231.21 162.8,-261.47 197,-283.5 201.71,-286.53 206.71,-289.5 211.79,-292.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.81,-295.25 220.27,-296.93 213.14,-289.09 209.81,-295.25"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="629,-211 542,-211 542,-192 629,-192 629,-211"/>
|
||||
<text text-anchor="middle" x="585.5" y="-199" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M111.74,-211.37C134.15,-225.51 166.05,-242.94 197,-250.5 323.05,-281.29 477.16,-238.67 546.96,-215.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.06,-218.51 556.38,-211.95 545.78,-211.89 548.06,-218.51"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" target="_top" xlink:title="Naive multiplication performed on this.">
|
||||
<polygon fill="white" stroke="#666666" points="338,-241 197,-241 197,-200 338,-200 338,-241"/>
|
||||
<text text-anchor="start" x="205" y="-229" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="205" y="-218" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-207" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M161.3,-203.44C169.28,-204.73 177.38,-206.05 185.37,-207.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.64,-210.77 195.07,-208.92 185.76,-203.86 184.64,-210.77"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="504,-154 376,-154 376,-113 504,-113 504,-154"/>
|
||||
<text text-anchor="start" x="384" y="-142" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="384" y="-131" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="440" y="-120" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M112.27,-169.68C134.68,-155.83 166.35,-138.87 197,-131.5 251.93,-118.28 315.92,-119.5 364.3,-123.64"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="363.84,-127.11 374.12,-124.55 364.48,-120.14 363.84,-127.11"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17" target="_top" xlink:title="Creates a new matrix and returns a part of it.">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-182 203.5,-182 203.5,-141 331.5,-141 331.5,-182"/>
|
||||
<text text-anchor="start" x="211.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-159" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-148" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M161.3,-177.99C171.46,-176.4 181.83,-174.77 191.9,-173.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.29,-176.68 201.63,-171.67 191.21,-169.76 192.29,-176.68"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe" target="_top" xlink:title="Horizontally stack the matrix (current matrix above the other)">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-84 203.5,-84 203.5,-43 331.5,-43 331.5,-84"/>
|
||||
<text text-anchor="start" x="211.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M104.75,-169.6C127.34,-149.89 163.11,-120.2 197,-98.5 201.71,-95.48 206.72,-92.52 211.81,-89.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.15,-92.94 220.29,-85.11 209.83,-86.78 213.15,-92.94"/>
|
||||
</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="#666666" points="498,-317 382,-317 382,-298 498,-298 498,-317"/>
|
||||
<text text-anchor="middle" x="440" y="-305" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.99,-314.4C344.46,-313.6 357.59,-312.75 370.22,-311.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="370.38,-315.43 380.14,-311.3 369.93,-308.45 370.38,-315.43"/>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.88,-337.52C382.25,-348.83 452.83,-355.89 506,-326.5 546.41,-304.16 568.82,-251.35 578.55,-222.02"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="581.79,-223.41 581.42,-212.83 575.1,-221.33 581.79,-223.41"/>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M338.24,-216.31C396.15,-212.82 477.35,-207.94 530.43,-204.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="530.36,-208.26 540.13,-204.17 529.94,-201.27 530.36,-208.26"/>
|
||||
</g>
|
||||
<!-- Node6->Node4 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node6->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M485.23,-154.46C507.18,-164.86 533.19,-177.19 553.08,-186.61"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="551.53,-189.75 562.07,-190.87 554.53,-183.42 551.53,-189.75"/>
|
||||
</g>
|
||||
<!-- Node7->Node4 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.69,-169.5C389.87,-176.86 475.27,-187.67 530.38,-194.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="529.8,-198.1 540.16,-195.89 530.68,-191.16 529.8,-198.1"/>
|
||||
</g>
|
||||
<!-- Node8->Node4 -->
|
||||
<g id="edge16" class="edge">
|
||||
<title>Node8->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.92,-62.14C382.32,-63.77 452.91,-72.31 506,-103.5 537.82,-122.19 561.89,-159.02 574.54,-181.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="571.32,-183.23 579.1,-190.41 577.5,-179.94 571.32,-183.23"/>
|
||||
</g>
|
||||
<!-- Node8->Node6 -->
|
||||
<g id="edge15" class="edge">
|
||||
<title>Node8->Node6</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M319.19,-84.31C337.5,-91.83 358.36,-100.39 377.49,-108.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="375.93,-111.39 386.51,-111.95 378.59,-104.91 375.93,-111.39"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="485,-56 395,-56 395,-37 485,-37 485,-56"/>
|
||||
<text text-anchor="middle" x="440" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node9 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node8->Node9</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.99,-57.17C348.91,-55.48 367.06,-53.67 383.52,-52.03"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="383.5,-55.55 393.1,-51.08 382.8,-48.59 383.5,-55.55"/>
|
||||
</g>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="506,-19 374,-19 374,0 506,0 506,-19"/>
|
||||
<text text-anchor="middle" x="440" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node10 -->
|
||||
<g id="edge14" class="edge">
|
||||
<title>Node8->Node10</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M328,-42.52C342.96,-37.43 359.02,-32.13 374,-27.5 379.45,-25.82 385.19,-24.12 390.9,-22.48"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.64,-25.91 400.31,-19.82 389.74,-19.17 391.64,-25.91"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 17 KiB |
@@ -0,0 +1,210 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication Pages: 1 -->
|
||||
<svg width="637pt" height="356pt"
|
||||
viewBox="0.00 0.00 637.00 355.52" 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 351.52)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...">
|
||||
<polygon fill="#999999" stroke="#666666" points="161,-211 0,-211 0,-170 161,-170 161,-211"/>
|
||||
<text text-anchor="start" x="8" y="-199" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="80.5" y="-177" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::strassens_multiplication</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M45.99,-211.49C42.7,-220.88 54.2,-229 80.5,-229 95.7,-229 105.96,-226.29 111.28,-222.18"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="114.52,-223.51 114.52,-212.92 107.91,-221.2 114.52,-223.51"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f" target="_top" xlink:title="Horizontally stack the matrix (one after the other)">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-339 203.5,-339 203.5,-298 331.5,-298 331.5,-339"/>
|
||||
<text text-anchor="start" x="211.5" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-316" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-305" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M104.28,-211.27C126.82,-231.21 162.8,-261.47 197,-283.5 201.71,-286.53 206.71,-289.5 211.79,-292.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.81,-295.25 220.27,-296.93 213.14,-289.09 209.81,-295.25"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="629,-211 542,-211 542,-192 629,-192 629,-211"/>
|
||||
<text text-anchor="middle" x="585.5" y="-199" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M111.74,-211.37C134.15,-225.51 166.05,-242.94 197,-250.5 323.05,-281.29 477.16,-238.67 546.96,-215.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="548.06,-218.51 556.38,-211.95 545.78,-211.89 548.06,-218.51"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" target="_top" xlink:title="Naive multiplication performed on this.">
|
||||
<polygon fill="white" stroke="#666666" points="338,-241 197,-241 197,-200 338,-200 338,-241"/>
|
||||
<text text-anchor="start" x="205" y="-229" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="205" y="-218" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-207" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M161.3,-203.44C169.28,-204.73 177.38,-206.05 185.37,-207.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.64,-210.77 195.07,-208.92 185.76,-203.86 184.64,-210.77"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="504,-154 376,-154 376,-113 504,-113 504,-154"/>
|
||||
<text text-anchor="start" x="384" y="-142" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="384" y="-131" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="440" y="-120" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M112.27,-169.68C134.68,-155.83 166.35,-138.87 197,-131.5 251.93,-118.28 315.92,-119.5 364.3,-123.64"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="363.84,-127.11 374.12,-124.55 364.48,-120.14 363.84,-127.11"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17" target="_top" xlink:title="Creates a new matrix and returns a part of it.">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-182 203.5,-182 203.5,-141 331.5,-141 331.5,-182"/>
|
||||
<text text-anchor="start" x="211.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-159" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-148" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M161.3,-177.99C171.46,-176.4 181.83,-174.77 191.9,-173.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="192.29,-176.68 201.63,-171.67 191.21,-169.76 192.29,-176.68"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe" target="_top" xlink:title="Horizontally stack the matrix (current matrix above the other)">
|
||||
<polygon fill="white" stroke="#666666" points="331.5,-84 203.5,-84 203.5,-43 331.5,-43 331.5,-84"/>
|
||||
<text text-anchor="start" x="211.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="211.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="267.5" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M104.75,-169.6C127.34,-149.89 163.11,-120.2 197,-98.5 201.71,-95.48 206.72,-92.52 211.81,-89.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="213.15,-92.94 220.29,-85.11 209.83,-86.78 213.15,-92.94"/>
|
||||
</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="#666666" points="498,-317 382,-317 382,-298 498,-298 498,-317"/>
|
||||
<text text-anchor="middle" x="440" y="-305" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.99,-314.4C344.46,-313.6 357.59,-312.75 370.22,-311.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="370.38,-315.43 380.14,-311.3 369.93,-308.45 370.38,-315.43"/>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.88,-337.52C382.25,-348.83 452.83,-355.89 506,-326.5 546.41,-304.16 568.82,-251.35 578.55,-222.02"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="581.79,-223.41 581.42,-212.83 575.1,-221.33 581.79,-223.41"/>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M338.24,-216.31C396.15,-212.82 477.35,-207.94 530.43,-204.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="530.36,-208.26 540.13,-204.17 529.94,-201.27 530.36,-208.26"/>
|
||||
</g>
|
||||
<!-- Node6->Node4 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node6->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M485.23,-154.46C507.18,-164.86 533.19,-177.19 553.08,-186.61"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="551.53,-189.75 562.07,-190.87 554.53,-183.42 551.53,-189.75"/>
|
||||
</g>
|
||||
<!-- Node7->Node4 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.69,-169.5C389.87,-176.86 475.27,-187.67 530.38,-194.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="529.8,-198.1 540.16,-195.89 530.68,-191.16 529.8,-198.1"/>
|
||||
</g>
|
||||
<!-- Node8->Node4 -->
|
||||
<g id="edge16" class="edge">
|
||||
<title>Node8->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.92,-62.14C382.32,-63.77 452.91,-72.31 506,-103.5 537.82,-122.19 561.89,-159.02 574.54,-181.82"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="571.32,-183.23 579.1,-190.41 577.5,-179.94 571.32,-183.23"/>
|
||||
</g>
|
||||
<!-- Node8->Node6 -->
|
||||
<g id="edge15" class="edge">
|
||||
<title>Node8->Node6</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M319.19,-84.31C337.5,-91.83 358.36,-100.39 377.49,-108.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="375.93,-111.39 386.51,-111.95 378.59,-104.91 375.93,-111.39"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="485,-56 395,-56 395,-37 485,-37 485,-56"/>
|
||||
<text text-anchor="middle" x="440" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node9 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node8->Node9</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M331.99,-57.17C348.91,-55.48 367.06,-53.67 383.52,-52.03"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="383.5,-55.55 393.1,-51.08 382.8,-48.59 383.5,-55.55"/>
|
||||
</g>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="506,-19 374,-19 374,0 506,0 506,-19"/>
|
||||
<text text-anchor="middle" x="440" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node10 -->
|
||||
<g id="edge14" class="edge">
|
||||
<title>Node8->Node10</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M328,-42.52C342.96,-37.43 359.02,-32.13 374,-27.5 379.45,-25.82 385.19,-24.12 390.9,-22.48"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="391.64,-25.91 400.31,-19.82 389.74,-19.17 391.64,-25.91"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 12 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::h_stack" name="divide_and_conquer::strassens_multiplication::Matrix::h_stack">
|
||||
<area shape="rect" id="node1" title="Horizontally stack the matrix (one after the other)" alt="" coords="5,16,176,71"/>
|
||||
<area shape="rect" id="node2" 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="224,5,379,31"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="243,55,359,80"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
4c47bc7c5730fa16491150565808f1c4
|
||||
@@ -0,0 +1,53 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::h_stack Pages: 1 -->
|
||||
<svg width="288pt" height="64pt"
|
||||
viewBox="0.00 0.00 288.00 64.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 60)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::h_stack</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Horizontally stack the matrix (one after the other)">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-48 0,-48 0,-7 128,-7 128,-48"/>
|
||||
<text text-anchor="start" x="8" y="-36" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-14" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</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/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="280,-56 164,-56 164,-37 280,-37 280,-56"/>
|
||||
<text text-anchor="middle" x="222" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.45,-35.23C136.36,-36.19 144.48,-37.18 152.47,-38.15"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.78,-41.6 162.13,-39.33 152.63,-34.65 151.78,-41.6"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="265.5,-19 178.5,-19 178.5,0 265.5,0 265.5,-19"/>
|
||||
<text text-anchor="middle" x="222" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.45,-20.18C141.24,-18.7 154.57,-17.17 167,-15.73"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="167.08,-19.25 176.61,-14.62 166.28,-12.29 167.08,-19.25"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.6 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator+" name="divide_and_conquer::strassens_multiplication::Matrix::operator+">
|
||||
<area shape="rect" id="node1" title="Add two matrices and returns a new matrix." alt="" coords="5,39,176,93"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="224,5,395,60"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="443,53,559,79"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
743fff35b34c09f8b32f5c77219ab7aa
|
||||
@@ -0,0 +1,61 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+ Pages: 1 -->
|
||||
<svg width="423pt" height="74pt"
|
||||
viewBox="0.00 0.00 423.00 74.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 70)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator+</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Add two matrices and returns a new matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="292,-66 164,-66 164,-25 292,-25 292,-66"/>
|
||||
<text text-anchor="start" x="172" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="172" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="228" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.1,-30.24C136.01,-31.46 144.16,-32.72 152.23,-33.96"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.63,-37.41 162.05,-35.48 152.7,-30.49 151.63,-37.41"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415,-30 328,-30 328,-11 415,-11 415,-30"/>
|
||||
<text text-anchor="middle" x="371.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.36,-17.56C140.2,-17.12 152.48,-16.73 164,-16.5 220.88,-15.35 235.13,-15.05 292,-16.5 299.88,-16.7 308.2,-17.01 316.37,-17.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.07,-20.87 326.22,-17.85 316.4,-13.88 316.07,-20.87"/>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M292.3,-34.32C300.31,-32.9 308.45,-31.46 316.3,-30.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.82,-33.54 326.05,-28.35 315.6,-26.65 316.82,-33.54"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.3 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator+=" name="divide_and_conquer::strassens_multiplication::Matrix::operator+=">
|
||||
<area shape="rect" id="node1" title="Add another matrices to current matrix." alt="" coords="5,39,176,93"/>
|
||||
<area shape="rect" id="node2" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="224,5,395,60"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="443,53,559,79"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
16d6251f42845b9c2d72a7acb2876a27
|
||||
@@ -0,0 +1,61 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+= Pages: 1 -->
|
||||
<svg width="423pt" height="74pt"
|
||||
viewBox="0.00 0.00 423.00 74.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 70)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator+=</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Add another matrices to current matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+=</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="292,-66 164,-66 164,-25 292,-25 292,-66"/>
|
||||
<text text-anchor="start" x="172" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="172" y="-43" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="228" y="-32" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.1,-30.24C136.01,-31.46 144.16,-32.72 152.23,-33.96"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.63,-37.41 162.05,-35.48 152.7,-30.49 151.63,-37.41"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="415,-30 328,-30 328,-11 415,-11 415,-30"/>
|
||||
<text text-anchor="middle" x="371.5" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.36,-17.56C140.2,-17.12 152.48,-16.73 164,-16.5 220.88,-15.35 235.13,-15.05 292,-16.5 299.88,-16.7 308.2,-17.01 316.37,-17.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.07,-20.87 326.22,-17.85 316.4,-13.88 316.07,-20.87"/>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M292.3,-34.32C300.31,-32.9 308.45,-31.46 316.3,-30.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="316.82,-33.54 326.05,-28.35 315.6,-26.65 316.82,-33.54"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.3 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::size" name="divide_and_conquer::strassens_multiplication::Matrix::size">
|
||||
<area shape="rect" id="node1" title="Get the matrix shape." alt="" coords="5,5,176,60"/>
|
||||
<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="224,20,340,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
4836f14dd6021f5a7fea3b75266fcc3b
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::size Pages: 1 -->
|
||||
<svg width="259pt" height="49pt"
|
||||
viewBox="0.00 0.00 259.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::size</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Get the matrix shape.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</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="#666666" points="251,-30 164,-30 164,-11 251,-11 251,-30"/>
|
||||
<text text-anchor="middle" x="207.5" y="-18" 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="#63b8ff" d="M128.3,-20.5C136.31,-20.5 144.45,-20.5 152.3,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.03,-24 162.03,-20.5 152.03,-17 152.03,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*" name="divide_and_conquer::strassens_multiplication::Matrix::operator*">
|
||||
<area shape="rect" id="node1" title="Multiply matrix with a number and returns a new matrix." alt="" coords="5,5,176,60"/>
|
||||
<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="224,20,340,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
f2527157475bcae89a47daa96643a02c
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
|
||||
<svg width="259pt" height="49pt"
|
||||
viewBox="0.00 0.00 259.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Multiply matrix with a number and returns a new matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</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="#666666" points="251,-30 164,-30 164,-11 251,-11 251,-30"/>
|
||||
<text text-anchor="middle" x="207.5" y="-18" 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="#63b8ff" d="M128.3,-20.5C136.31,-20.5 144.45,-20.5 152.3,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.03,-24 162.03,-20.5 152.03,-17 152.03,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*=" name="divide_and_conquer::strassens_multiplication::Matrix::operator*=">
|
||||
<area shape="rect" id="node1" title="Multiply a number to current matrix." alt="" coords="5,5,176,60"/>
|
||||
<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="224,20,340,45"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
1b191815451234ba1bfb908461abc0fb
|
||||
@@ -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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator*= Pages: 1 -->
|
||||
<svg width="259pt" height="49pt"
|
||||
viewBox="0.00 0.00 259.00 49.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 45)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::operator*=</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Multiply a number to current matrix.">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-41 0,-41 0,0 128,0 128,-41"/>
|
||||
<text text-anchor="start" x="8" y="-29" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-18" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*=</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="#666666" points="251,-30 164,-30 164,-11 251,-11 251,-30"/>
|
||||
<text text-anchor="middle" x="207.5" y="-18" 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="#63b8ff" d="M128.3,-20.5C136.31,-20.5 144.45,-20.5 152.3,-20.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.03,-24 162.03,-20.5 152.03,-17 152.03,-24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.9 KiB |
@@ -0,0 +1,7 @@
|
||||
<map id="divide_and_conquer::strassens_multiplication::Matrix::v_stack" name="divide_and_conquer::strassens_multiplication::Matrix::v_stack">
|
||||
<area shape="rect" id="node1" title="Horizontally stack the matrix (current matrix above the other)" alt="" coords="5,72,176,127"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="252,5,372,31"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/emplace_back.html#" title=" " alt="" coords="224,55,400,80"/>
|
||||
<area shape="rect" id="node4" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="227,104,397,159"/>
|
||||
<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="448,152,564,177"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
821481f85a6068425df73bc6f3ffa2d7
|
||||
@@ -0,0 +1,91 @@
|
||||
<?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 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::v_stack Pages: 1 -->
|
||||
<svg width="427pt" height="141pt"
|
||||
viewBox="0.00 0.00 427.00 140.85" 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 136.85)">
|
||||
<title>divide_and_conquer::strassens_multiplication::Matrix::v_stack</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Horizontally stack the matrix (current matrix above the other)">
|
||||
<polygon fill="#999999" stroke="#666666" points="128,-82.85 0,-82.85 0,-41.85 128,-41.85 128,-82.85"/>
|
||||
<text text-anchor="start" x="8" y="-70.85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="8" y="-59.85" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="64" y="-48.85" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</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/back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="275,-132.85 185,-132.85 185,-113.85 275,-113.85 275,-132.85"/>
|
||||
<text text-anchor="middle" x="230" y="-120.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M109.32,-83.18C126.22,-90.7 145.8,-98.92 164,-105.35 168.72,-107.02 173.68,-108.64 178.67,-110.17"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="177.51,-113.48 188.09,-112.95 179.49,-106.76 177.51,-113.48"/>
|
||||
</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/emplace_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="296,-95.85 164,-95.85 164,-76.85 296,-76.85 296,-95.85"/>
|
||||
<text text-anchor="middle" x="230" y="-83.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.41,-71.63C136.25,-72.78 144.33,-73.96 152.34,-75.13"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.69,-78.58 162.1,-76.56 152.71,-71.65 151.69,-78.58"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" target="_top" xlink:title="Get the matrix shape.">
|
||||
<polygon fill="white" stroke="#666666" points="294,-58.85 166,-58.85 166,-17.85 294,-17.85 294,-58.85"/>
|
||||
<text text-anchor="start" x="174" y="-46.85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
|
||||
<text text-anchor="start" x="174" y="-35.85" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
|
||||
<text text-anchor="middle" x="230" y="-24.85" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M128.41,-53.07C136.93,-51.83 145.74,-50.54 154.43,-49.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.88,-52.74 164.26,-47.83 153.86,-45.81 154.88,-52.74"/>
|
||||
</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="#666666" points="419,-22.85 332,-22.85 332,-3.85 419,-3.85 419,-22.85"/>
|
||||
<text text-anchor="middle" x="375.5" y="-10.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M94.61,-41.5C113.5,-29.51 139.04,-15.61 164,-9.35 215.96,3.68 277.42,0.48 320.47,-4.64"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="319.96,-8.1 330.33,-5.89 320.85,-1.16 319.96,-8.1"/>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M294.36,-27.31C303.03,-25.8 311.87,-24.26 320.36,-22.79"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="320.92,-26.24 330.17,-21.08 319.72,-19.34 320.92,-26.24"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.8 KiB |
@@ -677,7 +677,7 @@ template<typename T > </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="../../dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg" width="206" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg" width="250" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
|
||||
@@ -1,4 +1,5 @@
|
||||
<map id="operator*" name="operator*">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,80,31"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="128,5,200,31"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,31,80,56"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="150,5,222,31"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="128,55,244,80"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
3594aaaf77d9e00879b9e359d16ab39b
|
||||
3925f3f064c1dfc10ebb5b551b11680a
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: operator* Pages: 1 -->
|
||||
<svg width="154pt" height="27pt"
|
||||
viewBox="0.00 0.00 154.00 27.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 23)">
|
||||
<svg width="187pt" height="64pt"
|
||||
viewBox="0.00 0.00 187.00 64.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 60)">
|
||||
<title>operator*</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="56,-19 0,-19 0,0 56,0 56,-19"/>
|
||||
<text text-anchor="middle" x="28" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="56,-37 0,-37 0,-18 56,-18 56,-37"/>
|
||||
<text text-anchor="middle" x="28" y="-25" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -21,16 +21,31 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="146,-19 92,-19 92,0 146,0 146,-19"/>
|
||||
<text text-anchor="middle" x="119" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<polygon fill="white" stroke="#666666" points="162.5,-56 108.5,-56 108.5,-37 162.5,-37 162.5,-56"/>
|
||||
<text text-anchor="middle" x="135.5" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M56.19,-9.5C63.74,-9.5 72.09,-9.5 80.14,-9.5"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.08,-13 90.08,-9.5 80.08,-6 80.08,-13"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M56.44,-32.44C68.82,-34.67 83.62,-37.34 97,-39.75"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="96.33,-43.18 106.8,-41.51 97.57,-36.29 96.33,-43.18"/>
|
||||
</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/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="179,-19 92,-19 92,0 179,0 179,-19"/>
|
||||
<text text-anchor="middle" x="135.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M56.44,-22.82C63.83,-21.56 72.09,-20.15 80.39,-18.73"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.89,-22.2 90.16,-17.06 79.72,-15.3 80.89,-22.2"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.5 KiB After Width: | Height: | Size: 2.2 KiB |
@@ -1,7 +1,7 @@
|
||||
<map id="dynamic_programming/subset_sum.cpp" name="dynamic_programming/subset_sum.cpp">
|
||||
<area shape="rect" id="node1" title="Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,..." alt="" coords="99,5,252,45"/>
|
||||
<area shape="rect" id="node1" title="Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,..." alt="" coords="112,5,265,45"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,71,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="95,93,167,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="191,93,250,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="275,93,385,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="192,93,303,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="327,93,386,119"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
0c4466196bb7c3fcb7f6264156e4e73c
|
||||
1417e0c1284fd2830886efbe23e8c40c
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 7.0.6 (20230106.0513)
|
||||
-->
|
||||
<!-- Title: dynamic_programming/subset_sum.cpp Pages: 1 -->
|
||||
<svg width="293pt" height="93pt"
|
||||
viewBox="0.00 0.00 293.00 93.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="294pt" height="93pt"
|
||||
viewBox="0.00 0.00 293.50 93.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 89)">
|
||||
<title>dynamic_programming/subset_sum.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Implements [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm,...">
|
||||
<polygon fill="#999999" stroke="#666666" points="185,-85 70,-85 70,-55 185,-55 185,-85"/>
|
||||
<text text-anchor="start" x="78" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
|
||||
<text text-anchor="middle" x="127.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">/subset_sum.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="195,-85 80,-85 80,-55 195,-55 195,-85"/>
|
||||
<text text-anchor="start" x="88" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
|
||||
<text text-anchor="middle" x="137.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">/subset_sum.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -30,8 +30,8 @@
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M102.04,-54.54C86.11,-45.49 65.67,-33.88 49.77,-24.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.82,-21.99 41.39,-20.09 48.36,-28.08 51.82,-21.99"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M109.57,-54.54C91.92,-45.4 69.23,-33.66 51.73,-24.6"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.42,-21.53 42.93,-20.04 50.2,-27.75 53.42,-21.53"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
@@ -45,38 +45,38 @@
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M119.34,-54.54C114.99,-46.82 109.59,-37.24 104.93,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="108.1,-27.48 100.14,-20.49 102,-30.92 108.1,-27.48"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M126.87,-54.54C121.07,-46.65 113.84,-36.81 107.68,-28.44"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.52,-26.38 101.77,-20.39 104.88,-30.53 110.52,-26.38"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="183.5,-19 139.5,-19 139.5,0 183.5,0 183.5,-19"/>
|
||||
<text text-anchor="middle" x="161.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="223,-19 140,-19 140,0 223,0 223,-19"/>
|
||||
<text text-anchor="middle" x="181.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M135.9,-54.54C140.39,-46.82 145.96,-37.24 150.75,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="153.7,-30.89 155.7,-20.48 147.65,-27.37 153.7,-30.89"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M148.38,-54.54C154.38,-46.56 161.87,-36.59 168.22,-28.16"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.85,-30.48 174.07,-20.38 165.26,-26.27 170.85,-30.48"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="285,-19 202,-19 202,0 285,0 285,-19"/>
|
||||
<text text-anchor="middle" x="243.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">unordered_map</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="285.5,-19 241.5,-19 241.5,0 285.5,0 285.5,-19"/>
|
||||
<text text-anchor="middle" x="263.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M156.17,-54.54C174.37,-45.36 197.8,-33.55 215.8,-24.47"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="217.25,-27.66 224.61,-20.03 214.1,-21.41 217.25,-27.66"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M168.65,-54.54C188.69,-45.23 214.58,-33.22 234.24,-24.09"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="235.48,-27.37 243.07,-19.98 232.53,-21.02 235.48,-27.37"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.5 KiB After Width: | Height: | Size: 3.5 KiB |
@@ -1,7 +1,7 @@
|
||||
<map id="greedy_algorithms/boruvkas_minimum_spanning_tree.cpp" name="greedy_algorithms/boruvkas_minimum_spanning_tree.cpp">
|
||||
<area shape="rect" id="node1" title="[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning ..." alt="" coords="76,5,271,45"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,77,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="101,93,160,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="185,93,250,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="274,93,334,119"/>
|
||||
<area shape="rect" id="node1" title="[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning ..." alt="" coords="73,5,267,45"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,71,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="95,93,155,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="179,93,251,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="275,93,334,119"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
9d12a74c1dc8880000ebe84ff8b45fed
|
||||
615bd6423810d16a534b4a788f8efcdd
|
||||
@@ -12,9 +12,9 @@
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="[Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) to find the Minimum Spanning ...">
|
||||
<polygon fill="#999999" stroke="#666666" points="199,-85 53,-85 53,-55 199,-55 199,-85"/>
|
||||
<text text-anchor="start" x="61" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/boruvkas</text>
|
||||
<text text-anchor="middle" x="126" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_minimum_spanning_tree.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="196.5,-85 50.5,-85 50.5,-55 196.5,-55 196.5,-85"/>
|
||||
<text text-anchor="start" x="58.5" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/boruvkas</text>
|
||||
<text text-anchor="middle" x="123.5" y="-62" font-family="Helvetica,sans-Serif" font-size="10.00">_minimum_spanning_tree.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,61 +22,61 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="54,-19 0,-19 0,0 54,0 54,-19"/>
|
||||
<text text-anchor="middle" x="27" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="49,-19 0,-19 0,0 49,0 49,-19"/>
|
||||
<text text-anchor="middle" x="24.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M101.53,-54.54C86.36,-45.58 66.94,-34.1 51.73,-25.11"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="53.66,-22.19 43.27,-20.12 50.1,-28.22 53.66,-22.19"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M99.03,-54.54C83.86,-45.58 64.44,-34.1 49.23,-25.11"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="51.16,-22.19 40.77,-20.12 47.6,-28.22 51.16,-22.19"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="116,-19 72,-19 72,0 116,0 116,-19"/>
|
||||
<text text-anchor="middle" x="94" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="112,-19 67,-19 67,0 112,0 112,-19"/>
|
||||
<text text-anchor="middle" x="89.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M118.09,-54.54C113.92,-46.91 108.75,-37.46 104.27,-29.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="107.34,-27.6 99.47,-20.5 101.2,-30.96 107.34,-27.6"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M115.1,-54.54C110.61,-46.82 105.04,-37.24 100.25,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="103.35,-27.37 95.3,-20.48 97.3,-30.89 103.35,-27.37"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="183.5,-19 134.5,-19 134.5,0 183.5,0 183.5,-19"/>
|
||||
<text text-anchor="middle" x="159" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="184.5,-19 130.5,-19 130.5,0 184.5,0 184.5,-19"/>
|
||||
<text text-anchor="middle" x="157.5" y="-7" 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="#63b8ff" d="M134.16,-54.54C138.51,-46.82 143.91,-37.24 148.57,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.5,-30.92 153.36,-20.49 145.4,-27.48 151.5,-30.92"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M131.9,-54.54C136.39,-46.82 141.96,-37.24 146.75,-28.99"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.7,-30.89 151.7,-20.48 143.65,-27.37 149.7,-30.89"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="246.5,-19 201.5,-19 201.5,0 246.5,0 246.5,-19"/>
|
||||
<text text-anchor="middle" x="224" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="246.5,-19 202.5,-19 202.5,0 246.5,0 246.5,-19"/>
|
||||
<text text-anchor="middle" x="224.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M150.22,-54.54C165.24,-45.58 184.46,-34.1 199.52,-25.11"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.09,-28.25 207.88,-20.12 197.5,-22.24 201.09,-28.25"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M148.47,-54.54C163.94,-45.58 183.75,-34.1 199.27,-25.11"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.02,-28.15 207.92,-20.1 197.51,-22.09 201.02,-28.15"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.5 KiB After Width: | Height: | Size: 3.6 KiB |
@@ -115,7 +115,6 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Dynamic Programming algorithms. </p>
|
||||
<p>Dynamic programming algorithms.</p>
|
||||
<p>for unordered map</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>Dynamic Programming algorithm.</p>
|
||||
<p>Dynamic Programming Algorithms.</p>
|
||||
@@ -126,7 +125,7 @@ Functions</h2></td></tr>
|
||||
<p>Dynamic Programming algorithms</p>
|
||||
<p>for assert for IO operations</p>
|
||||
<p>Dynamic Programming algorithms</p>
|
||||
<p>for std::assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for std::assert for IO operations for unordered map</p>
|
||||
<p>Dynamic Programming algorithms </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a0a2215194e58786c34db1ccaf8031079" name="a0a2215194e58786c34db1ccaf8031079"></a>
|
||||
|
||||
@@ -0,0 +1,134 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.9.6"/>
|
||||
<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 id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.6 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.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">
|
||||
<div id="MSearchResults">
|
||||
<div class="SRPage">
|
||||
<div id="SRIndex">
|
||||
<div id="SRResults"></div>
|
||||
<div class="SRStatus" id="Loading">Loading...</div>
|
||||
<div class="SRStatus" id="Searching">Searching...</div>
|
||||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">divide_and_conquer::strassens_multiplication::Matrix< T, typename > Member List</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>_mat</b> (defined in <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">private</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">h_stack</a>(const Matrix< Number > &other)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a>(const Integer size)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9">Matrix</a>(const Integer rows, const Integer cols)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">naive_multiplication</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">operator*</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e">operator*</a>(const Number other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">operator*=</a>(const Number other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">operator+</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">operator+=</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">operator-</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">operator-=</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>operator<<</b> (defined in <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">friend</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">operator==</a>(const Matrix< T > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">operator[]</a>(const Integer index)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(const size_t row_start, const size_t row_end=MAX_SIZE, const size_t col_start=MAX_SIZE, const size_t col_end=MAX_SIZE) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">strassens_multiplication</a>(const Matrix< Number > &other) const</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">v_stack</a>(const Matrix< Number > &other)</td><td class="entry"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="entry"><span class="mlabel">inline</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="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -105,7 +105,11 @@ $(document).ready(function(){initNavTree('dd/dba/namespacedivide__and__conquer.h
|
||||
<a href="../../dd/dba/namespacedivide__and__conquer.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
<p><a href="https://en.wikipedia.org/wiki/Strassen_algorithm" target="_blank">Strassen's algorithm</a> is one of the methods for multiplying two matrices. It is one of the faster algorithms for larger matrices than naive multiplication method.</p>
|
||||
<p>for assert for string for IO operations</p>
|
||||
<p>Divide and Conquer algorithms</p>
|
||||
<p>It involves dividing each matrices into 4 blocks, given they are evenly divisible, and are combined with new defined matrices involving 7 matrix multiplications instead of eight, yielding O(n^2.8073) complexity.</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">AshishYUO</a> For assert operation For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html">std::chrono</a>; time measurement For I/O operations For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a> For creating dynamic arrays</dd></dl>
|
||||
<p>Divide and Conquer algorithms </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -3,6 +3,6 @@
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,93,80,119"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="105,93,170,119"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="195,93,267,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="291,93,349,119"/>
|
||||
<area shape="rect" id="node6" title=" " alt="" coords="373,93,427,119"/>
|
||||
<area shape="rect" id="node5" title=" " alt="" coords="291,93,344,119"/>
|
||||
<area shape="rect" id="node6" title=" " alt="" coords="368,93,427,119"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
9d031c15cfba5793068e4562076e4bf5
|
||||
d81ae1628ec245d64803883bdf82a150
|
||||
@@ -67,31 +67,31 @@
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="258,-19 214,-19 214,0 258,0 258,-19"/>
|
||||
<text text-anchor="middle" x="236" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="254,-19 214,-19 214,0 254,0 254,-19"/>
|
||||
<text text-anchor="middle" x="234" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">limits</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M185.56,-54.54C195.29,-46.04 207.61,-35.29 217.64,-26.53"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="219.69,-29.38 224.92,-20.17 215.09,-24.11 219.69,-29.38"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M185.07,-54.54C194.41,-46.13 206.22,-35.51 215.89,-26.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-29.48 223.24,-20.19 213.46,-24.28 218.14,-29.48"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="316,-19 276,-19 276,0 316,0 316,-19"/>
|
||||
<text text-anchor="middle" x="296" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">limits</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="316,-19 272,-19 272,0 316,0 316,-19"/>
|
||||
<text text-anchor="middle" x="294" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="#63b8ff" d="M200.39,-54.54C220.6,-45.23 246.69,-33.22 266.51,-24.09"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.8,-27.34 275.42,-19.98 264.87,-20.98 267.8,-27.34"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M199.9,-54.54C219.69,-45.28 245.23,-33.33 264.7,-24.21"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="266.15,-27.4 273.73,-19.99 263.19,-21.06 266.15,-27.4"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.2 KiB After Width: | Height: | Size: 4.2 KiB |
@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_func_h.html',''); initResiza
|
||||
 
|
||||
|
||||
<h3><a id="index_h" name="index_h"></a>- h -</h3><ul>
|
||||
<li>h_stack() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>hasChildren() : <a class="el" href="dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie</a></li>
|
||||
<li>hash() : <a class="el" href="dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash_chain</a></li>
|
||||
<li>hash_chain() : <a class="el" href="dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain</a></li>
|
||||
|
||||
@@ -106,8 +106,8 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
|
||||
<li>init() : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a></li>
|
||||
<li>inOrderIterative() : <a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
|
||||
<li>insert() : <a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree< T ></a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list< N ></a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>insert() : <a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
|
||||
<li>insertElement() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
|
||||
|
||||
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('functions_func_m.html',''); initResiza
|
||||
|
||||
<h3><a id="index_m" name="index_m"></a>- m -</h3><ul>
|
||||
<li>mat_mul() : <a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher</a></li>
|
||||
<li>Matrix() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>mean() : <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2< T ></a></li>
|
||||
<li>Merge() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234</a></li>
|
||||
<li>MergeNode() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">data_structures::tree_234::Tree234</a></li>
|
||||
|
||||
@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_func_n.html',''); initResiza
|
||||
 
|
||||
|
||||
<h3><a id="index_n" name="index_n"></a>- n -</h3><ul>
|
||||
<li>naive_multiplication() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>ncr() : <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08">math::ncr_modulo_p::NCRModuloP</a></li>
|
||||
<li>NCRModuloP() : <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9">math::ncr_modulo_p::NCRModuloP</a></li>
|
||||
<li>NeuralNetwork() : <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89">machine_learning::neural_network::NeuralNetwork</a></li>
|
||||
|
||||
@@ -113,27 +113,27 @@ $(document).ready(function(){initNavTree('functions_func_o.html',''); initResiza
|
||||
<li>operator&&() : <a class="el" href="db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t</a></li>
|
||||
<li>operator&=() : <a class="el" href="db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
<li>operator++() : <a class="el" href="db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">uint256_t</a></li>
|
||||
<li>operator+=() : <a class="el" href="db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t</a></li>
|
||||
<li>operator-() : <a class="el" href="da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t</a></li>
|
||||
<li>operator+=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t</a></li>
|
||||
<li>operator-() : <a class="el" href="da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t</a></li>
|
||||
<li>operator--() : <a class="el" href="db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">uint256_t</a></li>
|
||||
<li>operator-=() : <a class="el" href="db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t</a></li>
|
||||
<li>operator/() : <a class="el" href="da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">uint256_t</a></li>
|
||||
<li>operator-=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t</a></li>
|
||||
<li>operator/() : <a class="el" href="da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df">uint256_t</a></li>
|
||||
<li>operator/=() : <a class="el" href="db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">uint256_t</a></li>
|
||||
<li>operator<() : <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">uint256_t</a></li>
|
||||
<li>operator<<() : <a class="el" href="db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">uint256_t</a></li>
|
||||
<li>operator<<=() : <a class="el" href="db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">uint256_t</a></li>
|
||||
<li>operator<=() : <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">uint256_t</a></li>
|
||||
<li>operator=() : <a class="el" href="da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">Complex</a>, <a class="el" href="db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch< Puzzle >::Info</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">machine_learning::neural_network::layers::DenseLayer</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">machine_learning::neural_network::NeuralNetwork</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">uint256_t</a></li>
|
||||
<li>operator==() : <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">ciphers::elliptic_curve_key_exchange::Point</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">uint256_t</a></li>
|
||||
<li>operator<=() : <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">uint256_t</a></li>
|
||||
<li>operator=() : <a class="el" href="da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">Complex</a>, <a class="el" href="db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch< Puzzle >::Info</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114">machine_learning::neural_network::layers::DenseLayer</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601">machine_learning::neural_network::NeuralNetwork</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">uint256_t</a></li>
|
||||
<li>operator==() : <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">ciphers::elliptic_curve_key_exchange::Point</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">uint256_t</a></li>
|
||||
<li>operator>() : <a class="el" href="db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">uint256_t</a></li>
|
||||
<li>operator>=() : <a class="el" href="db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">uint256_t</a></li>
|
||||
<li>operator>>() : <a class="el" href="db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">uint256_t</a></li>
|
||||
<li>operator>>=() : <a class="el" href="db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">uint256_t</a></li>
|
||||
<li>operator[]() : <a class="el" href="db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number</a></li>
|
||||
<li>operator[]() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number</a></li>
|
||||
<li>operator^() : <a class="el" href="db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">uint256_t</a></li>
|
||||
<li>operator^=() : <a class="el" href="db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">uint256_t</a></li>
|
||||
<li>operator|() : <a class="el" href="db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">uint256_t</a></li>
|
||||
|
||||
@@ -116,14 +116,16 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
|
||||
<li>SG() : <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG< X ></a></li>
|
||||
<li>show() : <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list< N ></a></li>
|
||||
<li>single_predict() : <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
|
||||
<li>size() : <a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree< T ></a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
|
||||
<li>size() : <a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree< T ></a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
|
||||
<li>SkipList() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
|
||||
<li>slice() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>Solution() : <a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch< Puzzle ></a></li>
|
||||
<li>sort() : <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list< N ></a></li>
|
||||
<li>SplitNode() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a></li>
|
||||
<li>standard_deviation() : <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">probability::geometric_dist::geometric_distribution</a></li>
|
||||
<li>startwith() : <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie</a></li>
|
||||
<li>std() : <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2< T ></a></li>
|
||||
<li>strassens_multiplication() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>succ() : <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3">data_structures::linked_list::link</a></li>
|
||||
<li>SuggestAutocomplete() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>SuggestFreqAutocomplete() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
|
||||
@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza
|
||||
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
|
||||
<li>uint128_t() : <a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
|
||||
<li>uint256_t() : <a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>unionSet() : <a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>update() : <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG< X ></a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
|
||||
<li>upper() : <a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_func_v.html',''); initResiza
|
||||
 
|
||||
|
||||
<h3><a id="index_v" name="index_v"></a>- v -</h3><ul>
|
||||
<li>v_stack() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>val() : <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">data_structures::linked_list::link</a></li>
|
||||
<li>values() : <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></li>
|
||||
<li>variance() : <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution</a>, <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2< T ></a></li>
|
||||
|
||||
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_h.html',''); initResizable()
|
||||
<li>h_heavychlid : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">range_queries::heavy_light_decomposition::HLD< X ></a></li>
|
||||
<li>h_label : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD< X ></a></li>
|
||||
<li>h_parent : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD< X ></a></li>
|
||||
<li>h_stack() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>harr : <a class="el" href="d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">MinHeap</a></li>
|
||||
<li>hasChildren() : <a class="el" href="dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie</a></li>
|
||||
<li>hash() : <a class="el" href="dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash_chain</a></li>
|
||||
|
||||
@@ -106,8 +106,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
|
||||
<li>init() : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a></li>
|
||||
<li>inOrderIterative() : <a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
|
||||
<li>insert() : <a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree< T ></a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list< N ></a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>insert() : <a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
|
||||
<li>insertElement() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
|
||||
|
||||
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('functions_m.html',''); initResizable()
|
||||
<li>m : <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph</a></li>
|
||||
<li>main_q : <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack</a></li>
|
||||
<li>mat_mul() : <a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher</a></li>
|
||||
<li>Matrix() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>maxElement : <a class="el" href="dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu</a></li>
|
||||
<li>mean() : <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2< T ></a></li>
|
||||
<li>Merge() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234</a></li>
|
||||
|
||||
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
|
||||
|
||||
<h3><a id="index_n" name="index_n"></a>- n -</h3><ul>
|
||||
<li>n : <a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">data_structures::sparse_table::Sparse_table</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph</a></li>
|
||||
<li>naive_multiplication() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>ncr() : <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08">math::ncr_modulo_p::NCRModuloP</a></li>
|
||||
<li>NCRModuloP() : <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9">math::ncr_modulo_p::NCRModuloP</a></li>
|
||||
<li>neighbors : <a class="el" href="dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph< T ></a></li>
|
||||
|
||||
@@ -113,27 +113,27 @@ $(document).ready(function(){initNavTree('functions_o.html',''); initResizable()
|
||||
<li>operator&&() : <a class="el" href="db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t</a></li>
|
||||
<li>operator&=() : <a class="el" href="db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
<li>operator++() : <a class="el" href="db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">uint256_t</a></li>
|
||||
<li>operator+=() : <a class="el" href="db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t</a></li>
|
||||
<li>operator-() : <a class="el" href="da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t</a></li>
|
||||
<li>operator+=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t</a></li>
|
||||
<li>operator-() : <a class="el" href="da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t</a></li>
|
||||
<li>operator--() : <a class="el" href="db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">uint256_t</a></li>
|
||||
<li>operator-=() : <a class="el" href="db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t</a></li>
|
||||
<li>operator-=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t</a></li>
|
||||
<li>operator/() : <a class="el" href="da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex</a>, <a class="el" href="db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">uint256_t</a></li>
|
||||
<li>operator/=() : <a class="el" href="db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">uint256_t</a></li>
|
||||
<li>operator<() : <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">uint256_t</a></li>
|
||||
<li>operator<< : <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c">ciphers::elliptic_curve_key_exchange::Point</a>, <a class="el" href="db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">large_number</a>, <a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa">machine_learning::adaline</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">uint256_t</a></li>
|
||||
<li>operator<<=() : <a class="el" href="db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">uint256_t</a></li>
|
||||
<li>operator<=() : <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">uint256_t</a></li>
|
||||
<li>operator=() : <a class="el" href="da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">Complex</a>, <a class="el" href="db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch< Puzzle >::Info</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">machine_learning::neural_network::layers::DenseLayer</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">machine_learning::neural_network::NeuralNetwork</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">uint256_t</a></li>
|
||||
<li>operator==() : <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">ciphers::elliptic_curve_key_exchange::Point</a>, <a class="el" href="db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">uint256_t</a></li>
|
||||
<li>operator=() : <a class="el" href="da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">Complex</a>, <a class="el" href="db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number</a>, <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch< Puzzle >::Info</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">machine_learning::neural_network::layers::DenseLayer</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">machine_learning::neural_network::NeuralNetwork</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">uint256_t</a></li>
|
||||
<li>operator==() : <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">ciphers::elliptic_curve_key_exchange::Point</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number</a>, <a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle< N ></a>, <a class="el" href="db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">uint256_t</a></li>
|
||||
<li>operator>() : <a class="el" href="db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">uint256_t</a></li>
|
||||
<li>operator>=() : <a class="el" href="db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">uint256_t</a></li>
|
||||
<li>operator>> : <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a">statistics::stats_computer2< T ></a>, <a class="el" href="db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">uint256_t</a></li>
|
||||
<li>operator>>=() : <a class="el" href="db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">uint256_t</a></li>
|
||||
<li>operator[]() : <a class="el" href="db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number</a></li>
|
||||
<li>operator[]() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number</a></li>
|
||||
<li>operator^() : <a class="el" href="db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">uint256_t</a></li>
|
||||
<li>operator^=() : <a class="el" href="db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">uint256_t</a></li>
|
||||
<li>operator|() : <a class="el" href="db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">uint256_t</a></li>
|
||||
|
||||
@@ -122,9 +122,10 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
|
||||
<li>show() : <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list< N ></a></li>
|
||||
<li>side : <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a></li>
|
||||
<li>single_predict() : <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
|
||||
<li>size() : <a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree< T ></a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack< ValueType ></a></li>
|
||||
<li>size() : <a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree< T ></a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack< ValueType ></a></li>
|
||||
<li>size_ : <a class="el" href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree< T ></a></li>
|
||||
<li>SkipList() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
|
||||
<li>slice() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>Solution() : <a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch< Puzzle ></a></li>
|
||||
<li>sort() : <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list< N ></a></li>
|
||||
<li>SplitNode() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a></li>
|
||||
@@ -135,6 +136,7 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
|
||||
<li>standard_deviation() : <a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">probability::geometric_dist::geometric_distribution</a></li>
|
||||
<li>startwith() : <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie</a></li>
|
||||
<li>std() : <a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1< T ></a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2< T ></a></li>
|
||||
<li>strassens_multiplication() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>succ() : <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3">data_structures::linked_list::link</a></li>
|
||||
<li>SuggestAutocomplete() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>SuggestFreqAutocomplete() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
|
||||
@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()
|
||||
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
|
||||
<li>uint128_t() : <a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
|
||||
<li>uint256_t() : <a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>unionSet() : <a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>up : <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor</a></li>
|
||||
<li>update() : <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG< X ></a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
|
||||
<li>upper() : <a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
|
||||
|
||||
@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_v.html',''); initResizable()
|
||||
<div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
|
||||
|
||||
<h3><a id="index_v" name="index_v"></a>- v -</h3><ul>
|
||||
<li>v_stack() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></li>
|
||||
<li>val() : <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">data_structures::linked_list::link</a>, <a class="el" href="d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">ListNode</a>, <a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">range_queries::perSegTree::Node</a></li>
|
||||
<li>value : <a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree< T >::bst_node</a>, <a class="el" href="d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node</a></li>
|
||||
<li>values() : <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">tower</a></li>
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user